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).
An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic / C. Fiorentini - In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence / [a cura di] S. Kraus. - Prima edizione. - [s.l] : ijcai.org, 2019. - ISBN 9780999241141. - pp. 1675-1681 (( Intervento presentato al 28. convegno IJCAI tenutosi a Macao nel 2019 [10.24963/ijcai.2019/232].
An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic
C. Fiorentini
Primo
2019
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).
| File | Dimensione | Formato | |
|---|---|---|---|
|
2019_IJCAI.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
185.44 kB
Formato
Adobe PDF
|
185.44 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
