An ASP approach to generate minimal countermodels in intuitionistic propositional logic

7Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

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).

Cite

CITATION STYLE

APA

Fiorentini, C. (2019). An ASP approach to generate minimal countermodels in intuitionistic propositional logic. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2019-August, pp. 1675–1681). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2019/232

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free