{"type":"ScholarlyArticle","title":"Reasoning About Inconsistent Formulas","authors":[{"name":"Joao Marques-Silva","slug":"joao-marques-silva","given":"Joao","family":"Marques-Silva","affiliation":"ANITI , University of Toulouse , France"},{"name":"Carlos Mencía","slug":"carlos-mencia","given":"Carlos","family":"Mencía","affiliation":"University of Oviedo , Spain"}],"abstract":"The analysis of inconsistent formulas finds an ever-increasing range of applications, that include axiom pinpointing in description logics, fault localization in software, model-based diagnosis, optimization problems, but also explainability of machine learning models. This paper overviews approaches for analyzing inconsistent formulas, focusing on finding and enumerating explanations of and corrections for inconsistency, but also on solving optimization problems modeled as inconsistent formulas.","doi":"10.24963/ijcai.2020/682","url":"https://ijcai.org/proceedings/2020/682","pdf":"https://ijcai.org/proceedings/2020/0682.pdf","markdown":"https://ijcai.org/proceedings/2020/682.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/682","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Survey track","track":"Survey track","number":682,"pages":{"first":4899,"last":4906},"keywords":["Constraints and Satisfiability: general"],"videos":[],"references":[{"position":1,"raw":"[Alviano et al., 2015] Mario Alviano, Carmine Dodaro, and Francesco Ricca. A MaxSAT algorithm using cardinality constraints of bounded size. In IJCAI, pages 2677-2683, 2015.","title":"A MaxSAT algorithm using cardinality constraints of bounded size","authors":"Mario Alviano, Carmine Dodaro, Francesco Ricca","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/379"},{"position":2,"raw":"[Ansótegui et al., 2013] Carlos Ansótegui, Maria Luisa Bonet, and Jordi Levy. SAT-based MaxSAT algorithms. Artif. Intell., 196:77-105, 2013.","title":"SAT-based MaxSAT algorithms","authors":"Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Arif et al., 2015] M. Fareed Arif, Carlos Mencía, and Joao Marques-Silva. Efficient MUS enumeration of Horn for- mulae with applications to axiom pinpointing. In SAT, pages 324-342, 2015.","title":"Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing","authors":"M Fareed Arif, Carlos Mencía, Joao Marques-Silva","year":"2015","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bacchus and Katsirelos, 2015] Fahiem Bacchus and George Katsirelos. Using minimal correction sets to more effi- ciently compute minimal unsatisfiable sets. In CAV, 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":"CAV","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bacchus and Katsirelos, 2016] Fahiem Bacchus and George Katsirelos. Finding a collection of MUSes incrementally. In CPAIOR, pages 35-44, 2016.","title":"Fahiem Bacchus and George Katsirelos. Finding a collection of MUSes incrementally","authors":"Katsirelos Bacchus","year":"2016","venue":"CPAIOR","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bacchus et al., 2014] Fahiem Bacchus, Jessica Davies, Maria Tsimpoukelli, and George Katsirelos. Relaxation search: A simple way of managing optional clauses. In AAAI, pages 835-841, 2014.","title":"Relaxation search: A simple way of managing optional clauses","authors":"Bacchus","year":"2014","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bailey and Stuckey, 2005] James Bailey and Peter J. Stuckey. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In PADL, pages 174-186, 2005.","title":"Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization","authors":"James Bailey, Peter J Stuckey","year":"2005","venue":"PADL","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bakker et al., 1993] R. R. Bakker, F. Dikker, F. Tempel- man, and P. M. Wognum. Diagnosing and solving over- determined constraint satisfaction problems. In IJCAI, pages 276-281, 1993.","title":"Diagnosing and solving overdetermined constraint satisfaction problems","authors":"R R Bakker, F Dikker, F Tempelman, P M Wognum","year":"1993","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Belov and Marques-Silva, 2011] Anton Belov and Joao Marques-Silva. Minimally unsatisfiable boolean circuits. In SAT, pages 145-158, 2011.","title":"Minimally unsatisfiable boolean circuits","authors":"Marques-Silva ; Belov, Anton Belov, Joao Marques-Silva","year":"2011","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Belov et al., 2012] Anton Belov, Inês Lynce, and Joao Marques-Silva. Towards efficient MUS extraction. AI Commun., 25(2):97-116, 2012.","title":"Towards efficient MUS extraction","authors":"Anton Belov, Inês Lynce, Joao Marques-Silva","year":"2012","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ben-Ari, 2012] Mordechai Ben-Ari. Mathematical Logic for Computer Science. Springer, 2012.","title":"Mathematical Logic for Computer Science","authors":"Mordechai Ben-Ari","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bendík et al., 2018] Jaroslav Bendík, Ivana Cerná, and Nikola Benes. Recursive online enumeration of all min- imal unsatisfiable subsets. In ATVA, pages 143-159, 2018.","title":"Recursive online enumeration of all minimal unsatisfiable subsets","authors":"Bendík","year":"2018","venue":"ATVA","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Birnbaum and Lozinskii, 2003] Elazar Birnbaum and Eliezer L. Lozinskii. Consistent subsets of inconsistent systems: structure and behaviour. J. Exp. Theor. Artif. Intell., 15(1):25-46, 2003.","title":"Consistent subsets of inconsistent systems: structure and behaviour","authors":"Elazar Birnbaum, L Eliezer, Lozinskii","year":"2003","venue":"J. Exp. Theor. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Brandt et al., 2018] Felix Brandt, Christian Saile, and Christian Stricker. Voting with ties: Strong impossibili- ties via SAT solving. In AAMAS, pages 1285-1293, 2018.","title":"Voting with ties: Strong impossibilities via SAT solving","authors":"Felix Brandt, Christian Saile, Christian Stricker","year":"2018","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Brewka et al., 2019] Gerhard Brewka, Matthias Thimm, and Markus Ulbricht. Strong inconsistency. Artif. Intell., 267:78-117, 2019.","title":"Strong inconsistency","authors":"Gerhard Brewka, Matthias Thimm, Markus Ulbricht","year":"2019","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Chinneck and Dravnieks, 1991] John W. Chinneck and Erik W. Dravnieks. Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing, 3(2):157-168, 1991.","title":"Locating minimal infeasible constraint sets in linear programs","authors":"John W Chinneck, Erik W Dravnieks","year":"1991","venue":"ORSA Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Davies and Bacchus, 2011] Jessica Davies and Fahiem Bac- chus. Solving MAXSAT by solving a sequence of simpler SAT instances. In CP, pages 225-239, 2011.","title":"Jessica Davies and Fahiem Bacchus. Solving MAXSAT by solving a sequence of simpler SAT instances","authors":"Bacchus Davies","year":"2011","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[de Siqueira N. and Puget, 1988] J. L. de Siqueira N. and Jean-Francois Puget. Explanation-based generalisation of failures. In ECAI, pages 339-344, 1988.","title":"Explanation-based generalisation of failures","authors":"N De Siqueira, ; ] J L Puget, N De Siqueira, Jean-Francois Puget","year":"1988","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Dershowitz et al., 2006] Nachum Dershowitz, Ziyad Hanna, and Alexander Nadel. A scalable algorithm for minimal unsatisfiable core extraction. In SAT, pages 36-41, 2006.","title":"A scalable algorithm for minimal unsatisfiable core extraction","authors":"Nachum Dershowitz, Ziyad Hanna, Alexander Nadel","year":"2006","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":20,"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":21,"raw":"[Grégoire et al., 2014] Éric Grégoire, Jean-Marie Lagniez, and Bertrand Mazure. An experimentally efficient method for (MSS, CoMSS) partitioning. In AAAI, 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":"AAAI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Grégoire et al., 2018] Éric Grégoire, Yacine Izza, and Jean- Marie Lagniez. Boosting MCSes enumeration. In IJCAI, pages 1309-1315, 2018.","title":"Boosting MCSes enumeration","authors":"Éric Grégoire, Yacine Izza, Jean-Marie Lagniez","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/182"},{"position":23,"raw":"[Hemery et al., 2006] Fred Hemery, Christophe Lecoutre, Lakhdar Sais, and Frédéric Boussemart. Extracting MUCs from constraint networks. In ECAI, pages 113-117, 2006.","title":"Extracting MUCs from constraint networks","authors":"Fred Hemery, Christophe Lecoutre, Lakhdar Sais, Frédéric Boussemart","year":"2006","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Ignatiev et al., 2015] Alexey Ignatiev, Alessandro Previti, Mark H. Liffiton, and Joao Marques-Silva. Smallest MUS extraction with minimal hitting set dualization. In CP, pages 173-182, 2015.","title":"Smallest MUS extraction with minimal hitting set dualization","authors":"Alexey Ignatiev, Alessandro Previti, Mark H Liffiton, Joao Marques-Silva","year":"2015","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Ignatiev et al., 2019a] Alexey Ignatiev, António Morgado, Georg Weissenbacher, and Joao Marques-Silva. Model- based diagnosis with multiple observations. In IJCAI, pages 1108-1115, 2019.","title":"Modelbased diagnosis with multiple observations","authors":"Ignatiev","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Ignatiev et al., 2019b] Alexey Ignatiev, Nina Narodytska, and Joao Marques-Silva. Abduction-based explanations for machine learning models. In AAAI, pages 1511-1519, 2019.","title":"Abduction-based explanations for machine learning models","authors":"Ignatiev","year":"2019","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Ignatiev et al., 2019c] Alexey Ignatiev, Nina Narodytska, and Joao Marques-Silva. On relating explanations and adversarial examples. In NeurIPS, pages 15857-15867, 2019.","title":"On relating explanations and adversarial examples","authors":"Ignatiev","year":"2019","venue":"NeurIPS","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Ignatiev et al., 2019d] Alexey Ignatiev, Nina Narodytska, and Joao Marques-Silva. On validating, repairing and re- fining heuristic ML explanations. CoRR, abs/1907.02509, 2019.","title":"On validating, repairing and refining heuristic ML explanations","authors":"Ignatiev","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Junker, 2004] Ulrich Junker. QUICKXPLAIN: preferred explanations and relaxations for over-constrained prob- lems. In AAAI, pages 167-172, 2004.","title":"QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems","authors":"Ulrich Junker, Junker","year":"2004","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Kleine Büning and Kullmann, 2009] Hans Kleine Büning and Oliver Kullmann. Minimal unsatisfiability and au- tarkies. In Handbook of Satisfiability, pages 339-401. 2009.","title":"Minimal unsatisfiability and autarkies","authors":"Kleine Büning, ; Kullmann, Kleine Hans, Oliver Büning, Kullmann","year":"2009","venue":"Handbook of Satisfiability","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Korovin, 2013] Konstantin Korovin. Inst-Gen -A modu- lar approach to instantiation-based automated reasoning. In Programming Logics -Essays in Memory of Harald Ganzinger, pages 239-270, 2013.","title":"Inst-Gen -A modular approach to instantiation-based automated reasoning","authors":"Konstantin Korovin","year":"2013","venue":"Programming Logics -Essays in Memory of Harald Ganzinger","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Koshimura et al., 2012] Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, and Ryuzo Hasegawa. QMaxSAT: A par- tial Max-SAT solver. JSAT, 8(1/2):95-100, 2012.","title":"QMaxSAT: A partial Max-SAT solver","authors":"Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, Ryuzo Hasegawa","year":"2012","venue":"JSAT","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Kullmann and Marques-Silva, 2015] Oliver Kullmann and Joao Marques-Silva. Computing maximal autarkies with few and simple oracle queries. In SAT, pages 138-155, 2015.","title":"Computing maximal autarkies with few and simple oracle queries","authors":"Marques-Silva ; Kullmann, Oliver Kullmann, Joao Marques-Silva","year":"2015","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Le Berre and Parrain, 2010] Daniel Le Berre and Anne Par- rain. The Sat4j library, release 2.2. J. Satisf. Boolean Model. Comput., 7(2-3):59-6, 2010.","title":"Daniel Le Berre and Anne Parrain. The Sat4j library, release 2.2","authors":"Le Berre, Parrain","year":"2010","venue":"J. Satisf. Boolean Model. Comput","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Lewis, 1980] Harry R. Lewis. Complexity results for classes of quantificational formulas. J. Comput. Syst. Sci., 21(3):317-353, 1980.","title":"Complexity results for classes of quantificational formulas","authors":"R Harry, Lewis","year":"1980","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Li and Manyà, 2009] Chu Min Li and Felip Manyà. MaxSAT, hard and soft constraints. In Handbook of Satis- fiability, pages 613-631. 2009.","title":"MaxSAT, hard and soft constraints","authors":"Min Chu, Felip Li, Manyà","year":"2009","venue":"Handbook of Satisfiability","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Liberatore, 2005] Paolo Liberatore. Redundancy in logic I: CNF propositional formulae. Artif. Intell., 163(2):203- 232, 2005.","title":"Redundancy in logic I: CNF propositional formulae","authors":"Paolo Liberatore","year":"2005","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Liffiton and Sakallah, 2008] Mark H. Liffiton and Karem A. Sakallah. Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. 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":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":39,"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":40,"raw":"[Lonsing and Egly, 2015] Florian Lonsing and Uwe Egly. Incrementally computing minimal unsatisfiable cores of QBFs via a clause group solver API. In SAT, pages 191- 198, 2015.","title":"Incrementally computing minimal unsatisfiable cores of QBFs via a clause group solver API","authors":"Egly Lonsing, Florian Lonsing, Uwe Egly","year":"2015","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Lynce and Marques-Silva, 2004] Inês Lynce and Joao Marques-Silva. On computing minimum unsatisfiable cores. In SAT, 2004.","title":"On computing minimum unsatisfiable cores","authors":"Inês Lynce, Joao Marques-Silva","year":"2004","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Marques-Silva and Previti, 2014] Joao Marques-Silva and Alessandro Previti. On computing preferred MUSes and MCSes. In SAT, pages 58-74, 2014.","title":"On computing preferred MUSes and MCSes","authors":"Joao Marques, - Silva, Alessandro Previti","year":"2014","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Marques-Silva et al., 2013a] Joao Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, and Anton Belov. On computing minimal correction subsets. In IJ- CAI, pages 615-622, 2013.","title":"On computing minimal correction subsets","authors":"Marques-Silva","year":"2013","venue":"IJ-CAI","doi":null,"url":null,"internal_url":"/proceedings/2013/98"},{"position":44,"raw":"[Marques-Silva et al., 2013b] Joao Marques-Silva, Mikolás Janota, and Anton Belov. Minimal sets over monotone predicates in boolean formulae. In CAV, pages 592-607, 2013.","title":"Minimal sets over monotone predicates in boolean formulae","authors":"Marques-Silva","year":"2013","venue":"CAV","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Marques-Silva et al., 2015] Joao Marques-Silva, Mikolás Janota, Alexey Ignatiev, and António Morgado. Efficient model based diagnosis with maximum satisfiability. In IJ- CAI, pages 1966-1972, 2015.","title":"Efficient model based diagnosis with maximum satisfiability","authors":"Joao Marques-Silva, Mikolás Janota, Alexey Ignatiev, António Morgado","year":"2015","venue":"IJ-CAI","doi":null,"url":null,"internal_url":"/proceedings/2015/279"},{"position":46,"raw":"[Marques-Silva et al., 2016] Joao Marques-Silva, Alexey Ig- natiev, Carlos Mencía, and Rafael Peñaloza. Efficient rea- soning for inconsistent Horn formulae. In JELIA, pages 336-352, 2016.","title":"Efficient reasoning for inconsistent Horn formulae","authors":"Joao Marques-Silva, Alexey Ignatiev, Carlos Mencía, Rafael Peñaloza","year":"2016","venue":"JELIA","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Marques-Silva et al., 2017] Joao Marques-Silva, Mikolás Janota, and Carlos Mencía. Minimal sets on propositional formulae. problems and reductions. Artif. Intell., 252:22- 50, 2017.","title":"Minimal sets on propositional formulae. problems and reductions","authors":"Joao Marques-Silva, Mikolás Janota, Carlos Mencía","year":"2017","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Martins et al., 2014] Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, and Inês Lynce. Incremental car- dinality constraints for MaxSAT. In CP, pages 531-548, 2014.","title":"Incremental cardinality constraints for MaxSAT","authors":"Ruben Martins, Saurabh Joshi, M Vasco, Inês Manquinho, Lynce","year":"2014","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[McMillan and Amla, 2003] Kenneth L. McMillan and Nina Amla. Automatic abstraction without counterexamples. In TACAS, pages 2-17, 2003.","title":"Automatic abstraction without counterexamples","authors":"L Kenneth, Nina Mcmillan, Amla","year":"2003","venue":"TACAS","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"[Mencía et al., 2015] Carlos Mencía, Alessandro Previti, and Joao Marques-Silva. Literal-based MCS extraction. In IJCAI, pages 1973-1979, 2015.","title":"Literal-based MCS extraction","authors":"Carlos Mencía, Alessandro Previti, Joao Marques-Silva","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/280"},{"position":51,"raw":"[Mencía et al., 2016] Carlos Mencía, Alexey Ignatiev, Alessandro Previti, and Joao Marques-Silva. MCS extraction with sublinear oracle queries. In SAT, 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":"SAT","doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[Mencía et al., 2019] Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, and Joao Marques-Silva. On computing the union of MUSes. In SAT, pages 211-221, 2019.","title":"On computing the union of MUSes","authors":"Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, Joao Marques-Silva","year":"2019","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":53,"raw":"[Metodi et al., 2014] Amit Metodi, Roni Stern, Meir Kalech, and Michael Codish. A novel SAT-based approach to model based diagnosis. J. Artif. Intell. Res., 51:377-411, 2014.","title":"A novel SAT-based approach to model based diagnosis","authors":"Amit Metodi, Roni Stern, Meir Kalech, Michael Codish","year":"2014","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":54,"raw":"[Morgado et al., 2013] António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, and Joao Marques-Silva. Iterative and core-guided MaxSAT solving: A survey and assessment. Constraints, 18(4):478-534, 2013.","title":"Iterative and core-guided MaxSAT solving: A survey and assessment","authors":"António Morgado, Federico Heras, Mark H Liffiton, Jordi Planes, Joao Marques-Silva","year":"2013","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":55,"raw":"[Morgado et al., 2014] António Morgado, Carmine Dodaro, and Joao Marques-Silva. Core-guided MaxSAT with soft cardinality constraints. In CP, pages 564-573, 2014.","title":"Core-guided MaxSAT with soft cardinality constraints","authors":"António Morgado, Carmine Dodaro, Joao Marques-Silva","year":"2014","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":56,"raw":"[Nadel, 2010] Alexander Nadel. Boosting minimal unsatis- fiable core extraction. In FMCAD, pages 221-229, 2010.","title":"Boosting minimal unsatisfiable core extraction","authors":"Alexander Nadel","year":"2010","venue":"FMCAD","doi":null,"url":null,"internal_url":null},{"position":57,"raw":"[Narodytska et al., 2018] Nina Narodytska, Nikolaj Bjørner, Maria-Cristina V. Marinescu, and Mooly Sagiv. Core- guided minimal correction set and core enumeration. In IJCAI, pages 1353-1361, 2018.","title":"Coreguided minimal correction set and core enumeration","authors":"Narodytska","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":58,"raw":"[Nilsson and Maluszynski, 1995] Ulf Nilsson and Jan Maluszynski. Logic, programming and Prolog. Wiley, 1995.","title":"Ulf Nilsson and Jan Maluszynski. Logic, programming and Prolog","authors":"Maluszynski Nilsson","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":59,"raw":"[Peñaloza et al., 2017] Rafael Peñaloza, Carlos Mencía, Alexey Ignatiev, and Joao Marques-Silva. Lean kernels in description logics. In ESWC, pages 518-533, 2017.","title":"Lean kernels in description logics","authors":"Rafael Peñaloza, Carlos Mencía, Alexey Ignatiev, Joao Marques-Silva","year":"2017","venue":"ESWC","doi":null,"url":null,"internal_url":null},{"position":60,"raw":"[Polikarpova et al., 2016] Nadia Polikarpova, Ivan Kuraj, and Armando Solar-Lezama. Program synthesis from polymorphic refinement types. In PLDI, pages 522-538, 2016.","title":"Program synthesis from polymorphic refinement types","authors":"Nadia Polikarpova, Ivan Kuraj, Armando Solar-Lezama","year":"2016","venue":"PLDI","doi":null,"url":null,"internal_url":null},{"position":61,"raw":"[Previti et al., 2017] Alessandro Previti, Carlos Mencía, Matti Järvisalo, and Joao Marques-Silva. Improving MCS enumeration via caching. In SAT, 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":"SAT","doi":null,"url":null,"internal_url":null},{"position":62,"raw":"[Previti et al., 2018] Alessandro Previti, Carlos Mencía, Matti Järvisalo, and Joao Marques-Silva. Premise set caching for enumerating minimal correction subsets. In AAAI, pages 6633-6640, 2018.","title":"Premise set caching for enumerating minimal correction subsets","authors":"Alessandro Previti, Carlos Mencía, Matti Järvisalo, Joao Marques-Silva","year":"2018","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":63,"raw":"[Reiter, 1987] Raymond Reiter. A theory of diagnosis from first principles. Artif. Intell., 32(1):57-95, 1987.","title":"A theory of diagnosis from first principles","authors":"Raymond Reiter","year":"1987","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":64,"raw":"[Rosa et al., 2010] Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea. Solving satisfiability problems with preferences. Constraints, 15(4):485-515, 2010.","title":"Solving satisfiability problems with preferences","authors":"Emanuele Di, Rosa, Enrico Giunchiglia, Marco Maratea","year":"2010","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":65,"raw":"[Rothenberg and Grumberg, 2016] Bat-Chen Rothenberg and Orna Grumberg. Sound and complete mutation-based program repair. In FM, pages 593-611, 2016.","title":"Bat-Chen Rothenberg and Orna Grumberg. Sound and complete mutation-based program repair","authors":"Grumberg Rothenberg","year":"2016","venue":"FM","doi":null,"url":null,"internal_url":null},{"position":66,"raw":"[Sebastiani and Vescovi, 2009] Roberto Sebastiani and Michele Vescovi. Axiom pinpointing in lightweight description logics via Horn-SAT encoding and conflict analysis. In CADE, pages 84-99, 2009.","title":"Axiom pinpointing in lightweight description logics via Horn-SAT encoding and conflict analysis","authors":"Vescovi Sebastiani, Roberto Sebastiani, Michele Vescovi","year":"2009","venue":"CADE","doi":null,"url":null,"internal_url":null},{"position":67,"raw":"[Seidl et al., 2012] Martina Seidl, Florian Lonsing, and Armin Biere. qbf2epr: A tool for generating EPR formulas from QBF. In PAAR@IJCAR, pages 139-148, 2012.","title":"qbf2epr: A tool for generating EPR formulas from QBF","authors":"Martina Seidl, Florian Lonsing, Armin Biere","year":"2012","venue":"PAAR@IJCAR","doi":null,"url":null,"internal_url":null},{"position":68,"raw":"[Si et al., 2017] Xujie Si, Xin Zhang, Radu Grigore, and Mayur Naik. Maximum satisfiability in software analy- sis: Applications and techniques. In CAV, pages 68-94, 2017.","title":"Maximum satisfiability in software analysis: Applications and techniques","authors":"Si","year":"2017","venue":"CAV","doi":null,"url":null,"internal_url":null},{"position":69,"raw":"[Terra-Neves et al., 2017] Miguel Terra-Neves, Inês Lynce, and Vasco M. Manquinho. Introducing Pareto minimal correction subsets. In SAT, pages 195-211, 2017.","title":"Vasco M. Manquinho. Introducing Pareto minimal correction subsets","authors":"Terra-Neves","year":"2017","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":70,"raw":"[Wieringa, 2012] Siert Wieringa. Understanding, improving and parallelizing MUS finding using model rotation. In CP, pages 672-687, 2012.","title":"Understanding, improving and parallelizing MUS finding using model rotation","authors":"Siert Wieringa, Wieringa","year":"2012","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":71,"raw":"[Xie and Luo, 2016] Huiyuan Xie and Jie Luo. An algorithm to compute minimal unsatisfiable subsets for a decidable fragment of first-order formulas. In ICTAI, pages 444- 451, 2016.","title":"An algorithm to compute minimal unsatisfiable subsets for a decidable fragment of first-order formulas","authors":"Luo ; ] Huiyuan Xie, Jie Xie, Luo","year":"2016","venue":"ICTAI","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}