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:
INESC-ID ESR Talks – February 2023
If you are a masters/PhD student or a postdoctoral fellow, come and present your work in an informal and friendly environment – and savour some tasty snacks!
Individual talks will be 10-15 minutes plus time for feedback. Enroll on your selected date by emailing pedro.ferreira[at]inesc-id.pt.
Happening on the second Wednesday of every month (4pm-5pm):
- 15 February (Alves Redol, Room 9)
- 15 March (Alves Redol, Room 9)
- 12 April (Alves Redol, Room 9)
- 10 May (Alves Redol, Room 9)
- 14 June (Alves Redol, Room 9)
- 12 July (Alves Redol, Room 9)
We hope to see you there!