Unsatisfiability-Based Algorithms for Maximum Satisfiability
João Paulo Marques-Silva,
University of Southampton –
The problem of Maximum Satisfiability (MaxSAT) and some of its
variants find an increasing number of practical applications in a wide
range of areas. Examples include optimization problems in digital
system design and verification, and in bioinformatics. However, most
practical instances of MaxSAT are too hard for existing branch and
bound algorithms. One recent alternative to branch and bound MaxSAT
algorithms is based on unsatisfiable subformula identification. This
talk provides an overview of recent algorithms for MaxSAT based on
unsatisfiable subformula identification.
Date: 2008-Mar-07 Time: 11:00:00 Room: 336
For more information:
Workshop “Metabolism and mathematical models: Two for a tango” – 2nd Edition
Title: Workshop Metabolism and mathematical models: Two for a tango – 2nd Edition
Dates: October 25-26, 2022
Location: This workshop will be held in a virtual way
The topic of this workshop is metabolism in general, with a special focus, although not exclusive, on parasitology. Besides an exploration of the biological, biochemical and biomedical aspects, the workshop will also aim at presenting some of the mathematical modelling, algorithmic theory and software development that have become crucial to explore such aspects.
This workshop is being organised in the context of two projects, both with the Inria European Team Erable. One of the projects involves a partnership with the University of São Paulo (USP), in São Paulo, Brazil, more specifically the Institute of Mathematics and Statistics (IME) and the Institute of Biomedical Sciences – Inria Associated Team Capoeira – and the other involves the Inesc-ID/IST in Portugal, ETH in Zürich and EMBL in Heidelberg – H2020 Twinning Project Olissipo.
The workshop is open to all members of these two projects but also, importantly, to the community in general.
The program and more details are available here.