{"type":"ScholarlyArticle","title":"An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic","authors":[{"name":"Camillo Fiorentini","slug":"camillo-fiorentini","given":"Camillo","family":"Fiorentini","affiliation":"Department of Computer Science , University of Milan , Italy"}],"abstract":"Intuitionistic Propositional Logic  is complete w.r.t. Kripke semantics: if a formula is not intuitionistically  valid, then there exists a finite Kripke model falsifying it. The problem of obtaining concise models  has been scarcely investigated in the literature. We present a procedure to generate minimal models in the number of worlds relying  on  Answer Set Programming (ASP).","doi":"10.24963/ijcai.2019/232","url":"https://ijcai.org/proceedings/2019/232","pdf":"https://ijcai.org/proceedings/2019/0232.pdf","markdown":"https://ijcai.org/proceedings/2019/232.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/232","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":232,"pages":{"first":1675,"last":1681},"keywords":["Heuristic Search and Game Playing: Modeling","Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving"],"videos":[],"references":[{"position":1,"raw":"[Baral, 2010] Chitta Baral. Knowledge Representation, Rea- soning and Declarative Problem Solving. Cambridge Uni- versity Press, 2010.","title":"Knowledge Representation, Reasoning and Declarative Problem Solving","authors":"Chitta Baral","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bry and Yahya, 2000] Franc ¸ois Bry and Adnan H. Yahya. Positive unit hyperresolution tableaux and their applica- tion to minimal model generation. J. Autom. Reasoning, 25(1):35-82, 2000.","title":"Franc ¸ois Bry and Adnan H. Yahya. Positive unit hyperresolution tableaux and their applica-tion to minimal model generation","authors":"Yahya Bry","year":"2000","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chagrov and Zakharyaschev, 1997] Alexander V. Chagrov and Michael Zakharyaschev, Modal Logic. Oxford Uni- versity Press, 1997.","title":"Modal Logic","authors":"Alexander V Chagrov, Michael Zakharyaschev","year":"1997","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cheney et al., 2016] James Cheney, Alberto Momigliano, and Matteo Pessina. Advances in Property-Based Testing for αProlog. In TAP, volume 9762 of LNCS, pages 37-56. Springer, 2016.","title":"Advances in Property-Based Testing for αProlog","authors":"James Cheney, Alberto Momigliano, Matteo Pessina","year":"2016","venue":"TAP","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Claessen and Rosén, 2015] Koen Claessen and Dan Rosén. SAT modulo intuitionistic implications. In M. Davis et al., editors., LPAR-20, Proceedings, volume 9450 of LNCS, pages 622-637. Springer, 2015.","title":"SAT modulo intuitionistic implications","authors":"Rosén Claessen, Koen Claessen, Dan Rosén","year":"2015","venue":"LPAR-20, Proceedings","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Corsi and Tassi, 2007] Giovanna Corsi and Gabriele Tassi. Intuitionistic logic freed of all metarules. J. Symb. Log., 72(4):1204-1218, 2007.","title":"Intuitionistic logic freed of all metarules","authors":"Giovanna Corsi, Gabriele Tassi","year":"2007","venue":"J. Symb. Log","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Dantsin et al., 2001] Evgeny Dantsin, Thomas Eiter, Georg Gottlob, and Andrei Voronkov. Complexity and expres- sive power of logic programming. ACM Comput. Surv., 33(3):374-425, 2001.","title":"Complexity and expressive power of logic programming","authors":"Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov","year":"2001","venue":"ACM Comput. Surv","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Demri et al., 2014] Stéphane Demri, Deepak Kapur, and Christoph Weidenbach, editors. IJCAR 2014, Proceedings, volume 8562 of LNCS. Springer, 2014.","title":"IJCAR 2014, Proceedings","authors":null,"year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dummett, 1959] Michael Dummett. A propositional calcu- lus with denumerable matrix. J. Symbolic Logic, 24(2):97- 106, 1959.","title":"A propositional calculus with denumerable matrix","authors":"Michael Dummett","year":"1959","venue":"J. Symbolic Logic","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dyckhoff, 2016] Roy Dyckhoff. Intuitionistic decision pro- cedures since Gentzen. In Advances in proof theory, vol- ume 28 of Progr. Comput. Sci. Appl. Logic, pages 245- 267. Birkhäuser/Springer, [Cham], 2016.","title":"Intuitionistic decision procedures since Gentzen","authors":"Roy Dyckhoff","year":"2016","venue":"Advances in proof theory","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ferrari et al., 2013] Mauro Ferrari, Camillo Fiorentini, and Guido Fiorino. Contraction-free linear depth sequent cal- culi for intuitionistic propositional logic with the subfor- mula property and minimal depth counter-models. J. Au- tom. Reasoning, 51(2):129-149, 2013.","title":"Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models","authors":"Mauro Ferrari, Camillo Fiorentini, Guido Fiorino","year":"2013","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Ferrari et al., 2015] Mauro Ferrari, Camillo Fiorentini, and Guido Fiorino. An evaluation-driven decision procedure for G3i. ACM Trans. Comput. Log., 16(1):8:1-8:37, 2015.","title":"An evaluation-driven decision procedure for G3i","authors":"Mauro Ferrari, Camillo Fiorentini, Guido Fiorino","year":"2015","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Fiorentini and Ferrari, 2017] Camillo Fiorentini and Mauro Ferrari. A forward unprovability calculus for intuitionis- tic propositional logic. In R. A. Schmidt and C. Nalon, editors, TABLEAUX 2017, volume 10501 of LNCS, pages 114-130. Springer, 2017.","title":"A forward unprovability calculus for intuitionistic propositional logic","authors":"Camillo Fiorentini, Mauro Ferrari","year":"2017","venue":"TABLEAUX 2017","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Galmiche and Larchey-Wendling, 1999] Didier Galmiche and Dominique Larchey-Wendling. Structural sharing and efficient proof-search in propositional intuitionistic logic.","title":"Structural sharing and efficient proof-search in propositional intuitionistic logic","authors":"Larchey-Wendling ; Galmiche, Didier Galmiche, Dominique Larchey-Wendling","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"In P. S. Thiagarajan et al., editors, Advances in Computing Science -ASIAN'99, Proceedings, volume 1742 of LNCS, pages 101-112. Springer, 1999.","title":"Advances in Computing Science -ASIAN'99, Proceedings","authors":null,"year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gebser et al., 2011] Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Thomas Schneider. Potassco: The Potsdam An- swer Set Solving Collection. AI Commun., 24(2):107-124, 2011.","title":"Potassco: The Potsdam Answer Set Solving Collection","authors":"Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, Marius Thomas Schneider","year":"2011","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gebser et al., 2012] Martin Gebser, Roland Kaminsk, Ben- jamin Kaufmann, and Torsten Schaub. Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers, 2012.","title":"Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning","authors":"Gebser","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Goré and Thomson, 2012] Rajeev Goré and Jimmy Thom- son. Bdd-based automated reasoning for propositional bi- intuitionistic tense logics. In B. Gramlich et al., editors, IJCAR 2012, Proceedings, volume 7364 of LNCS, pages 301-315. Springer, 2012.","title":"Bdd-based automated reasoning for propositional biintuitionistic tense logics","authors":"Rajeev Goré, Jimmy Thomson","year":"2012","venue":"IJCAR 2012, Proceedings","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Goré et al., 2014] Rajeev Goré, Kerry Olesen, and Jimmy Thomson. Implementing tableau calculi using bdds: Bd- dtab system description. In Demri et al. [2014], pages 337-343.","title":"Implementing tableau calculi using bdds: Bddtab system description","authors":"Rajeev Goré, Kerry Olesen, Jimmy Thomson","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Larchey-Wendling et al., 2001] Dominique Larchey- Wendling, Dominique Méry, and Didier Galmiche. STRIP: Structural Sharing for Efficient Proof-Search. In R. Goré et al., editors, IJCAR 2001, Proceedings, volume 2083 of LNCS, pages 696-700. Springer, 2001.","title":"STRIP: Structural Sharing for Efficient Proof-Search","authors":"Dominique Larchey-Wendling, Dominique Méry, Didier Galmiche","year":"2001","venue":"IJCAR 2001, Proceedings","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lorenz, 1994] Sven Lorenz. A tableaux prover for domain minimization. J. Autom. Reasoning, 13(3):375-390, 1994.","title":"A tableaux prover for domain minimization","authors":"Sven Lorenz","year":"1994","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Negri, 2014] Sara Negri. Proofs and countermodels in non- classical logics. Logica Universalis, 8(1):25-60, 2014.","title":"Proofs and countermodels in nonclassical logics","authors":"Sara Negri","year":"2014","venue":"Logica Universalis","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Niemelä, 1996] Ilkka Niemelä. A tableau calculus for min- imal model reasoning. In P. Miglioli et al., editors, TABLEAUX '96, Proceedings, volume 1071 of LNCS, pages 278-294. Springer, 1996.","title":"A tableau calculus for minimal model reasoning","authors":"Ilkka Niemelä","year":"1996","venue":"TABLEAUX '96, Proceedings","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Papacchini and Schmidt, 2011] Fabio Papacchini and Re- nate A. Schmidt. A tableau calculus for minimal modal model generation. Electr. Notes Theor. Comput. Sci., 278:159-172, 2011.","title":"Fabio Papacchini and Renate A. Schmidt. A tableau calculus for minimal modal model generation","authors":"Schmidt Papacchini","year":"2011","venue":"Electr. Notes Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Papacchini and Schmidt, 2014] Fabio Papacchini and Re- nate A. Schmidt. Terminating minimal model generation procedures for propositional modal logics. In Demri et al. [2014], pages 381-395.","title":"Fabio Papacchini and Renate A. Schmidt. Terminating minimal model generation procedures for propositional modal logics","authors":"Schmidt Papacchini","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Pearce, 1997] David Pearce. A new logical characterisation of stable models and answer sets. In J. Dix et al., editors, Non-Monotonic Extensions of Logic Programming, pages 57-70, Berlin, Heidelberg, 1997. Springer Berlin Heidel- berg. [Pinto and Dyckhoff, 1995] Luis Pinto and Roy Dyckhoff. Loop-free construction of counter-models for intuitionis- tic propositional logic. In Behara et al., editor, Sym- posia Gaussiana, Conference A, pages 225-232.","title":"Loop-free construction of counter-models for intuitionistic propositional logic","authors":"David Pearce","year":"1995","venue":"Non-Monotonic Extensions of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Raths et al., 2007] Thomas Raths, Jens Otten and Christoph Kreitz. The ILTP problem library for intuitionistic logic. J. Autom. Reasoning, 31:261-271, 2007.","title":"The ILTP problem library for intuitionistic logic","authors":"Thomas Raths, Jens Otten, Christoph Kreitz","year":"2007","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Skura, 2011] Tomasz Skura. Refutation Systems in Propo- sitional Logic. In D. Gabbay et al., editors, Handbook of Philosophical Logic, volume 16, pages 115-157. Springer, Dordrecht, 2011.","title":"Refutation Systems in Propositional Logic","authors":"Tomasz Skura","year":"2011","venue":"Handbook of Philosophical Logic","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Svejdar, 2006] Vítezslav Svejdar. On sequent calculi for intuitionistic propositional logic. Comment. Math. Univ. Carolinae, 47(1):159-173, 2006.","title":"Vítezslav Svejdar. On sequent calculi for intuitionistic propositional logic","authors":"Svejdar","year":"2006","venue":"Comment. Math. Univ. Carolinae","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}