{"type":"ScholarlyArticle","title":"Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle","authors":[{"name":"Éric Grégoire","slug":"eric-gregoire","given":"Éric","family":"Grégoire","affiliation":""},{"name":"Bertrand Mazure","slug":"bertrand-mazure","given":"Bertrand","family":"Mazure","affiliation":""},{"name":"Cédric Piette","slug":"cedric-piette","given":"Cédric","family":"Piette","affiliation":""}],"abstract":"In this paper, a new complete technique to compute Maximal Satisfiable Subsets (MSS) and Minimally Unsatisfiable Subformulas (MUS) of sets of Boolean clauses is introduced. The approach improves the currently most efficient complete technique in several ways. It makes use of the powerful concept of critical clause and of a computationally inexpensive local search oracle to boost an exhaustive algorithm proposed by Liffiton and Sakallah. These features can allow exponential efficiency gains to be obtained. Accordingly, experimental studies show that this new approach outperforms the best current existing exhaustive ones.","doi":null,"url":"https://ijcai.org/proceedings/2007/370","pdf":"https://ijcai.org/proceedings/2007/0370.pdf","markdown":"https://ijcai.org/proceedings/2007/370.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/370","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":370,"pages":{"first":2300,"last":2304},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}