{"type":"ScholarlyArticle","title":"Boosting MCSes Enumeration","authors":[{"name":"Éric Grégoire","slug":"eric-gregoire","given":"Éric","family":"Grégoire","affiliation":"CRIL -Université d'Artois & CNRS , Lens , France"},{"name":"Yacine Izza","slug":"yacine-izza","given":"Yacine","family":"Izza","affiliation":"CRIL -Université d'Artois & CNRS , Lens , France"},{"name":"Jean-Marie Lagniez","slug":"jean-marie-lagniez","given":"Jean-Marie","family":"Lagniez","affiliation":"CRIL -Université d'Artois & CNRS , Lens , France"}],"abstract":"The enumeration of all Maximal Satisfiable Subsets (MSSes) or all Minimal Correction Subsets (MCSes) of an unsatisfiable CNF Boolean formula is a useful and sometimes necessary step for solving a variety of important A.I. issues. Although the number of different MCSes of a CNF Boolean formula is exponential in the worst case, it remains low in many practical situations; this makes the tentative enumeration possibly successful in these latter cases. In the paper, a technique is introduced that boosts the currently most efficient practical approaches to enumerate MCSes. It implements a model rotation paradigm that allows the set of MCSes to be computed in an heuristically efficient way.","doi":"10.24963/ijcai.2018/182","url":"https://ijcai.org/proceedings/2018/182","pdf":"https://ijcai.org/proceedings/2018/0182.pdf","markdown":"https://ijcai.org/proceedings/2018/182.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/182","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Constraints and SAT","track":"Main track","number":182,"pages":{"first":1309,"last":1315},"keywords":["Constraints and SAT: SAT","Constraints and SAT: Constraints and SAT","Constraints and SAT: SAT: Solvers and Tools"],"videos":[],"references":[{"position":1,"raw":"[Audemard et al., 2013] Gilles Audemard, Jean-Marie Lagniez, and Laurent Simon. Improving glucose for incremental SAT solving with assumptions: Application to MUS extraction. In Proc. of SAT 2013, pages 309-317, 2013.","title":"Improving glucose for incremental SAT solving with assumptions: Application to MUS extraction","authors":"Audemard","year":"2013","venue":"Proc. of SAT 2013","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bacchus and Katsirelos, 2015] Fahiem Bacchus and George Katsirelos. Using minimal correction sets to more effi- ciently compute minimal unsatisfiable sets. In Proc. of CAV 2015, pages 70-86, 2015.","title":"Fahiem Bacchus and George Katsirelos. Using minimal correction sets to more efficiently compute minimal unsatisfiable sets","authors":"Katsirelos Bacchus","year":"2015","venue":"Proc. of CAV 2015","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bacchus and Katsirelos, 2016] Fahiem Bacchus and George Katsirelos. Finding a collection of muses incrementally. In Proc. of CPAIOR 2016, pages 35-44, 2016.","title":"Fahiem Bacchus and George Katsirelos. Finding a collection of muses incrementally","authors":"Katsirelos Bacchus","year":"2016","venue":"Proc. of CPAIOR 2016","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bacchus et al., 2014] Fahiem Bacchus, Jessica Davies, Maria Tsimpoukelli, and George Katsirelos. Relaxation search: A simple way of managing optional clauses. In Proc. of AAAI 2014, pages 835-841, 2014.","title":"Relaxation search: A simple way of managing optional clauses","authors":"Bacchus","year":"2014","venue":"Proc. of AAAI 2014","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Belov and Marques-Silva, 2011a] Anton Belov and João Marques-Silva. Accelerating MUS extraction with recur- sive model rotation. In Proc. of FMCAD 2011, pages 37- 40, 2011.","title":"Accelerating MUS extraction with recursive model rotation","authors":"Marques-Silva ; Belov, Anton Belov, João Marques-Silva","year":"2011","venue":"Proc. of FMCAD 2011","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Belov and Marques-Silva, 2011b] Anton Belov and João Marques-Silva. Accelerating MUS extraction with recur- sive model rotation. In Proc. of FMCAD 2011, pages 37- 40, 2011.","title":"Accelerating MUS extraction with recursive model rotation","authors":"Marques-Silva ; Belov, Anton Belov, João Marques-Silva","year":"2011","venue":"Proc. of FMCAD 2011","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bobrow, 1980] Daniel G. Bobrow. Special issue non non- monotonic logics. Artificial Intelligence, 13(1-2), 1980.","title":"Special issue non nonmonotonic logics","authors":"G Daniel, Bobrow","year":"1980","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chen and Toda, 1995] Zhi-Zhong Chen and Seinosuke Toda. The complexity of selecting maximal solutions. Information and Computation, 119(2):231-239, 1995. [Eén and Sörensson, 2003] Niklas Eén and Niklas Sörensson. An extensible SAT-solver. In Selected Revised Papers of the 6th Int. Conf. of SAT 2003, pages 502-518, 2003.","title":"The complexity of selecting maximal solutions","authors":"Chen, Toda ; Zhi-Zhong Chen, Seinosuke Toda","year":"1995","venue":"Int. Conf. of SAT 2003","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Felfernig et al., 2012] Alexander Felfernig, Monika Schu- bert, and Christoph Zehentner. An efficient diagnosis algo- rithm for inconsistent constraint sets. AI EDAM, 26(1):53- 62, 2012.","title":"An efficient diagnosis algorithm for inconsistent constraint sets","authors":"Alexander Felfernig, Monika Schubert, Christoph Zehentner","year":"2012","venue":"AI EDAM","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Fermé and Hansson, 2011] Eduardo L. Fermé and Sven Ove Hansson. AGM 25 years -twenty-five years of research in belief change. Journal of Philosophical Logic, 40(2):295-331, 2011.","title":"AGM 25 years -twenty-five years of research in belief change","authors":"Eduardo L Fermé, Sven Ove Hansson","year":"2011","venue":"Journal of Philosophical Logic","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Grégoire et al., 2007] Éric Grégoire, Bertrand Mazure, and Cédric Piette. Boosting a complete technique to find MSS and MUS thanks to a local search oracle. In Proc. of IJCAI 2007, pages 2300-2305, 2007.","title":"Boosting a complete technique to find MSS and MUS thanks to a local search oracle","authors":"Éric Grégoire, Bertrand Mazure, Cédric Piette","year":"2007","venue":"Proc. of IJCAI 2007","doi":null,"url":null,"internal_url":"/proceedings/2007/370"},{"position":12,"raw":"[Grégoire et al., 2014] Éric Grégoire, Jean-Marie Lagniez, and Bertrand Mazure. An experimentally efficient method for (MSS, CoMSS) partitioning. In Proc. of (AAAI 2014), pages 2666-2673, 2014.","title":"An experimentally efficient method for (MSS, CoMSS) partitioning","authors":"Éric Grégoire, Jean-Marie Lagniez, Bertrand Mazure","year":"2014","venue":"Proc. of (AAAI 2014)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hamscher et al., 1992] Walter Hamscher, Luca Console, and Johan de Kleer. Readings in model-based diagnosis.","title":"Readings in model-based diagnosis","authors":"Hamscher","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"Morgan Kaufmann, 1992.","title":null,"authors":"Morgan Kaufmann","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lagniez and Biere, 2013] Jean-Marie Lagniez and Armin Biere. Factoring out assumptions to speed up MUS ex- traction. In Proc. of SAT 2013, pages 276-292, 2013.","title":"Factoring out assumptions to speed up MUS extraction","authors":"Biere ; Jean-Marie Lagniez, Armin Lagniez, Biere","year":"2013","venue":"Proc. of SAT 2013","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Lagniez et al., 2015] Jean-Marie Lagniez, Emmanuel Lonca, and Jean-Guy Mailly. Coquiaas: A constraint- based quick abstract argumentation solver. In Proc. of ICTAI 2015, pages 928-935, 2015.","title":"Coquiaas: A constraintbased quick abstract argumentation solver","authors":"Lagniez","year":"2015","venue":"Proc. of ICTAI 2015","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Liffiton and Sakallah, 2008] Mark H. Liffiton and Karem A. Sakallah. Algorithms for computing minimal unsatisfiable subsets of constraints. Journal of Automated Reasoning, 40(1):1-33, 2008.","title":"Algorithms for computing minimal unsatisfiable subsets of constraints","authors":"H Mark, Karem A Liffiton, Sakallah","year":"2008","venue":"Journal of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Liffiton et al., 2016] Mark H. Liffiton, Alessandro Previti, Ammar Malik, and Joao Marques-Silva. Fast, flexible MUS enumeration. Constraints, 21(2):223-250, 2016.","title":"Fast, flexible MUS enumeration","authors":"H Mark, Alessandro Liffiton, Ammar Previti, Joao Malik, Marques-Silva","year":"2016","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Marques-Silva et al., 2013] João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, and Anton Belov. On computing minimal correction subsets. In Proc. of IJCAI 2013, pages 615-622, 2013.","title":"On computing minimal correction subsets","authors":"João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, Anton Belov","year":"2013","venue":"Proc. of IJCAI 2013","doi":null,"url":null,"internal_url":"/proceedings/2013/98"},{"position":20,"raw":"[Marques-Silva et al., 2015] João Marques-Silva, Mikolás Janota, Alexey Ignatiev, and António Morgado. Efficient model based diagnosis with maximum satisfiability. In Proc. of IJCAI 2015, pages 1966-1972, 2015.","title":"Efficient model based diagnosis with maximum satisfiability","authors":"João Marques-Silva, Mikolás Janota, Alexey Ignatiev, António Morgado","year":"2015","venue":"Proc. of IJCAI 2015","doi":null,"url":null,"internal_url":"/proceedings/2015/279"},{"position":21,"raw":"[Mencía et al., 2015] Carlos Mencía, Alessandro Previti, and João Marques-Silva. Literal-based MCS extraction. In Proc. of IJCAI 2015, pages 1973-1979, 2015.","title":"Literal-based MCS extraction","authors":"Carlos Mencía, Alessandro Previti, João Marques-Silva","year":"2015","venue":"Proc. of IJCAI 2015","doi":null,"url":null,"internal_url":"/proceedings/2015/280"},{"position":22,"raw":"[Mencía et al., 2016] Carlos Mencía, Alexey Ignatiev, Alessandro Previti, and Joao Marques-Silva. MCS extraction with sublinear oracle queries. In Proc. of SAT 2016, pages 342-360, 2016.","title":"MCS extraction with sublinear oracle queries","authors":"Carlos Mencía, Alexey Ignatiev, Alessandro Previti, Joao Marques-Silva","year":"2016","venue":"Proc. of SAT 2016","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Meseguer et al., 2003] Pedro Meseguer, Noureddine Bouh- mala, Taoufik Bouzoubaa, Morten Irgens, and Martí Sánchez-Fibla. Current approaches for solving over- constrained problems. Constraints, 8(1):9-39, 2003.","title":"Current approaches for solving overconstrained problems","authors":"Pedro Meseguer, Noureddine Bouhmala, Taoufik Bouzoubaa, Morten Irgens, Martí Sánchez-Fibla","year":"2003","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Nadel et al., 2014] Alexander Nadel, Vadim Ryvchin, and Ofer Strichman. Accelerated deletion-based extraction of minimal unsatisfiable cores. Journal of Satisfiability JSAT, 9:27-51, 2014.","title":"Accelerated deletion-based extraction of minimal unsatisfiable cores","authors":"Alexander Nadel, Ofer Vadim Ryvchin, Strichman","year":"2014","venue":"Journal of Satisfiability JSAT","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Previti and Marques-Silva, 2013] Alessandro Previti and João Marques-Silva. Partial MUS enumeration. In Proc. of AAAI 2013, 2013.","title":"Partial MUS enumeration","authors":"Alessandro Previti, João Marques-Silva","year":"2013","venue":"Proc. of AAAI 2013","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Previti et al., 2017] Alessandro Previti, Carlos Mencía, Matti Järvisalo, and Joao Marques-Silva. Improving MCS enumeration via caching. In Proc. of SAT 2017, pages 184-194, 2017.","title":"Improving MCS enumeration via caching","authors":"Alessandro Previti, Carlos Mencía, Matti Järvisalo, Joao Marques-Silva","year":"2017","venue":"Proc. of SAT 2017","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Reiter, 1980] Raymond Reiter. A logic for default reason- ing. Artificial Intelligence, 13(1-2):81-132, 1980.","title":"A logic for default reasoning","authors":"Raymond Reiter","year":"1980","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Reiter, 1987] Raymond Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57-95, 1987.","title":"A theory of diagnosis from first principles","authors":"Raymond Reiter","year":"1987","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}