{"type":"ScholarlyArticle","title":"A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem","authors":[{"name":"Jean-Marie Lagniez","slug":"jean-marie-lagniez","given":"Jean-Marie","family":"Lagniez","affiliation":"CRIL , Univ. Artois and CNRS , F62300 Lens , France"},{"name":"Daniel Le Berre","slug":"daniel-le-berre","given":"Daniel","family":"Le Berre","affiliation":"CRIL , Univ. Artois and CNRS , F62300 Lens , France"},{"name":"Tiago de Lima","slug":"tiago-de-lima","given":"Tiago","family":"de Lima","affiliation":"CRIL , Univ. Artois and CNRS , F62300 Lens , France"},{"name":"Valentin Montmirail","slug":"valentin-montmirail","given":"Valentin","family":"Montmirail","affiliation":"CRIL , Univ. Artois and CNRS , F62300 Lens , France"}],"abstract":"Counter-Example-Guided Abstraction Refinement (CEGAR) has been very successful in model checking large systems. Since then, it has been applied to many different problems. It especially proved to be an highly successful practical approach for solving the PSPACE complete QBF problem. In this paper, we propose a new CEGAR-like approach for tackling PSPACE complete problems that we call RECAR (Recursive Explore and Check Abstraction Refinement). We show that this generic approach is sound and complete. Then we propose a specific implementation of the RECAR approach to solve the modal logic K satisfiability problem. We implemented both a CEGAR and a RECAR approach for the modal logic K satisfiability problem within the solver MoSaiC. We compared experimentally those approaches to the state-of-the-art solvers for that problem. The RECAR approach outperforms the CEGAR one for that problem and also compares favorably against the state-of-the-art on the benchmarks considered.","doi":"10.24963/ijcai.2017/94","url":"https://ijcai.org/proceedings/2017/94","pdf":"https://ijcai.org/proceedings/2017/0094.pdf","markdown":"https://ijcai.org/proceedings/2017/94.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/94","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Constraints and Satisfiability","track":"Main track","number":94,"pages":{"first":674,"last":680},"keywords":["Constraints and Satisfiability: Satisfiability","Constraints and Satisfiability: Modeling/Formulation","Knowledge Representation, Reasoning, and Logic: Non-classical logics for Knowledge Representation"],"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'13, 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'13","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Balsiger et al., 2000] Peter Balsiger, Alain Heuerding, and Stefan Schwendimann. A Benchmark Method for the Propositional Modal Logics K, KT, S4. J. Autom. Rea- soning, 24(3):297-317, 2000.","title":"A Benchmark Method for the Propositional Modal Logics K, KT, S4","authors":"Peter Balsiger, Alain Heuerding, Stefan Schwendimann","year":"2000","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Biere et al., 2009] Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors. Handbook of Satisfi- ability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press, 2009.","title":"Handbook of Satisfiability","authors":"Biere","year":"2009","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Brummayer and Biere, 2009] Robert Brummayer and Armin Biere. Effective bit-width and under- approximation. In Proc. of EUROCAST'09, pages 304-311, 2009.","title":"Effective bit-width and underapproximation","authors":"Robert Brummayer, Armin Biere","year":"2009","venue":"Proc. of EUROCAST'09","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Caridroit et al., 2017] Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, and Valentin Montmirail. A SAT-based Approach For Solving The Modal Logic S5-Satisfiability Problem. In Proc. of AAAI'17, 2017.","title":"A SAT-based Approach For Solving The Modal Logic S5-Satisfiability Problem","authors":"Thomas Caridroit, Jean-Marie Lagniez, Daniel Le Berre, Tiago De Lima, Valentin Montmirail","year":"2017","venue":"Proc. of AAAI'17","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Clarke et al., 2003] Edmund M. Clarke, Orna Grum- berg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement for sym- bolic model checking. J. ACM, 50(5):752-794, 2003. [Eén and Sörensson, 2003] Niklas Eén and Niklas Sörensson. An Extensible SAT-solver. In Proc. of SAT'03, pages 502-518, 2003.","title":"Counterexample-guided abstraction refinement for symbolic model checking","authors":"Edmund M Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith","year":"2003","venue":"Proc. of SAT'03","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Giunchiglia et al., 2002] Enrico Giunchiglia, Armando Tac- chella, and Fausto Giunchiglia. SAT-Based Decision Pro- cedures for Classical Modal Logics. J. Autom. Reasoning, 28(2):143-171, 2002.","title":"SAT-Based Decision Procedures for Classical Modal Logics","authors":"Enrico Giunchiglia, Armando Tacchella, Fausto Giunchiglia","year":"2002","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Goré et al., 2014] Rajeev Goré, Kerry Olesen, and Jimmy Thomson. Implementing Tableau Calculi Using BDDs: BDDTab System Description. In Proc. of IJCAR'14, pages 337-343, 2014.","title":"Implementing Tableau Calculi Using BDDs: BDDTab System Description","authors":"Rajeev Goré, Kerry Olesen, Jimmy Thomson","year":"2014","venue":"Proc. of IJCAR'14","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Götzmann et al., 2010] Daniel Götzmann, Mark Kaminski, and Gert Smolka. Spartacus: A Tableau Prover for Hybrid Logic. Electr. Notes Theor. Comput. Sci., 262:127-139, 2010.","title":"Spartacus: A Tableau Prover for Hybrid Logic","authors":"Mark Daniel Götzmann, Gert Kaminski, Smolka","year":"2010","venue":"Electr. Notes Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Halpern and Moses, 1992] Joseph Y. Halpern and Yoram Moses. A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief. Artif. Intell., 54(2):319-379, 1992.","title":"A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief","authors":"Joseph Y Halpern, Yoram Moses","year":"1992","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Horrocks et al., 2007] Ian Horrocks, Ullrich Hustadt, Ul- rike Sattler, and Renate A. Schmidt. 4 Computational modal logic. Studies in Logic and Practical Reasoning, 3:181-245, 2007.","title":"4 Computational modal logic","authors":"Ian Horrocks, Ullrich Hustadt, Ulrike Sattler, Renate A Schmidt","year":"2007","venue":"Studies in Logic and Practical Reasoning","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Janota et al., 2016] Mikolás Janota, William Klieber, Joao Marques-Silva, and Edmund M. Clarke. Solving QBF with counterexample guided refinement. Artif. Intell., 234:1- 25, 2016.","title":"Solving QBF with counterexample guided refinement","authors":"Janota","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Järvisalo et al., 2012] Matti Järvisalo, Daniel Le Berre, Olivier Roussel, and Laurent Simon. The international SAT solver competitions. AI Magazine, 33(1), 2012.","title":"The international SAT solver competitions","authors":"Järvisalo","year":"2012","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kaminski and Tebbi, 2013] Mark Kaminski and Tobias Tebbi. InKreSAT: Modal Reasoning via Incremental Re- duction to SAT. In Proc. of CADE'13, pages 436-442, 2013.","title":"InKreSAT: Modal Reasoning via Incremental Reduction to SAT","authors":"Mark Kaminski, Tobias Tebbi","year":"2013","venue":"Proc. of CADE'13","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Khasidashvili et al., 2015] Zurab Khasidashvili, Konstantin Korovin, and Dmitry Tsarkov. EPR-based k-induction with Counterexample Guided Abstraction Refinement. In Proc. of GCAI'15, volume 36, pages 137-150, 2015.","title":"EPR-based k-induction with Counterexample Guided Abstraction Refinement","authors":"Zurab Khasidashvili, Konstantin Korovin, Dmitry Tsarkov","year":"2015","venue":"Proc. of GCAI'15","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kovács and Voronkov, 2013] Laura Kovács and Andrei Voronkov. First-Order Theorem Proving and Vampire. In Proc. of CAV'13, pages 1-35, 2013.","title":"First-Order Theorem Proving and Vampire","authors":"Laura Kovács, Andrei Voronkov","year":"2013","venue":"Proc. of CAV'13","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Ladner, 1977] Richard E. Ladner. The Computational Com- plexity of Provability in Systems of Modal Propositional Logic. SIAM J. Comput., 6(3):467-480, 1977.","title":"The Computational Complexity of Provability in Systems of Modal Propositional Logic","authors":"Richard E Ladner","year":"1977","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Massacci and Donini, 2000] Fabio Massacci and Francesco M. Donini. Design and results of TANCS-2000 non-classical (modal) systems comparison. In Proc. of TABLEAUX'00, pages 52-56, 2000.","title":"Design and results of TANCS-2000 non-classical (modal) systems comparison","authors":"Fabio Massacci, Francesco M Donini","year":"2000","venue":"Proc. of TABLEAUX'00","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Nalon et al., 2016] Cláudia Nalon, Ullrich Hustadt, and Clare Dixon. K S P : A Resolution-Based Prover for Mul- timodal K. In Proc. of IJCAR'16, pages 406-415, 2016.","title":"A Resolution-Based Prover for Multimodal K","authors":"Cláudia Nalon, Ullrich Hustadt, Clare Dixon","year":"2016","venue":"Proc. of IJCAR'16","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Patel-Schneider and Sebastiani, 2011] Peter F. Patel- Schneider and Roberto Sebastiani. A new general method to generate random modal formulae for testing decision procedures. CoRR, abs/1106.5261, 2011.","title":"A new general method to generate random modal formulae for testing decision procedures","authors":"F Peter, Roberto Patel-Schneider, Sebastiani","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Prestwich, 2009] Steven David Prestwich. CNF encodings. In Handbook of Satisfiability, pages 75-97. IOS Press, 2009.","title":"CNF encodings","authors":"Steven David, Prestwich","year":"2009","venue":"Handbook of Satisfiability","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Pulina, 2016] Luca Pulina. The ninth QBF solvers evalua- tion -preliminary report. In Proc. of the 4th International Workshop (QBF 2016) co-located with (SAT 2016), pages 1-13, 2016.","title":"The ninth QBF solvers evaluation -preliminary report","authors":"Luca Pulina","year":"2016","venue":"Proc. of the 4th International Workshop (QBF 2016) co-located with (SAT 2016)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Sebastiani and Tacchella, 2009] Roberto Sebastiani and Ar- mando Tacchella. SAT techniques for modal and descrip- tion logics. In Handbook of Satisfiability, pages 781-824. IOS Press, 2009.","title":"SAT techniques for modal and description logics","authors":"Roberto Sebastiani, Armando Tacchella","year":"2009","venue":"Handbook of Satisfiability","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Sebastiani and Vescovi, 2009] Roberto Sebastiani and Michele Vescovi. Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability. J. Artif. Intell. Res. (JAIR), 35:343-389, 2009.","title":"Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability","authors":"Vescovi Sebastiani, Roberto Sebastiani, Michele Vescovi","year":"2009","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Seipp and Helmert, 2013] Jendrik Seipp and Malte Helmert. Counterexample-guided cartesian abstrac- tion refinement. In Proc. of ICAPS'13, 2013.","title":"Jendrik Seipp and Malte Helmert. Counterexample-guided cartesian abstraction refinement","authors":"Helmert Seipp","year":"2013","venue":"Proc. of ICAPS'13","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Tsarkov and Horrocks, 2006] Dmitry Tsarkov and Ian Hor- rocks. FaCT++ Description Logic Reasoner: System De- scription. In Proc. of IJCAR'06, pages 292-297, 2006.","title":"Dmitry Tsarkov and Ian Horrocks. FaCT++ Description Logic Reasoner: System Description","authors":"Horrocks Tsarkov","year":"2006","venue":"Proc. of IJCAR'06","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Wang et al., 2007] Chao Wang, Aarti Gupta, and Franjo Ivancic. Induction in CEGAR for detecting counterexam- ples. In Proc. of FMCAD'07, pages 77-84, 2007.","title":"Induction in CEGAR for detecting counterexamples","authors":"Chao Wang, Aarti Gupta, Franjo Ivancic","year":"2007","venue":"Proc. of FMCAD'07","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}