Using local search to locate MUS
Olivier Fourdrinoy,
Université d’Artois –
Abstract:
Whereas computing a sat instance consists in checking whether the instance is consistent or not, computing kernels of an inconsistent sat instance consists in finding Minimally Unsatisfiable Subformulae (MUS). In this presentation, local search is used to locate the inconsistency of an instance and finally to locate MUS.
Date: 2006-Apr-11 Time: 16:00:00 Room: 217
For more information:
Upcoming Events
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!