Local-Search Extraction of MUSes Éric

@inproceedings{Grgoire2007LocalSearchEO,
  title={Local-Search Extraction of MUSes {\'E}ric},
  author={{\'E}ric Gr{\'e}goire and Bertrand Mazure and C{\'e}dric Piette},
  year={2007}
}
SAT is probably one of the most-studied constraint satisfac tion problems. In this paper, a new hybrid technique based on local search is in troduced in order to approximate and extract minimally unsatisfiable subformul as (in short, MUSes) of unsatisfiable SAT instances. It is based on an original count ing heuristic grafted to a local search algorithm, which explores the neighborhood o f the current interpretation in an original manner, making use of a critical clause concept. Intuitively, a… CONTINUE READING