ML Anthology

An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic

Camillo Fiorentini
IJCAI 2019 pp. 1675-1681
doi:10.24963/IJCAI.2019/232 /ijcai/2019/fiorentini2019ijcai-asp/

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

PDF IJCAI Semantic Scholar

Cite

Text

Fiorentini. "An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/232

Markdown

[Fiorentini. "An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/fiorentini2019ijcai-asp/) doi:10.24963/IJCAI.2019/232

BibTeX

@inproceedings{fiorentini2019ijcai-asp,
  title     = {{An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic}},
  author    = {Fiorentini, Camillo},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {1675-1681},
  doi       = {10.24963/IJCAI.2019/232},
  url       = {https://mlanthology.org/ijcai/2019/fiorentini2019ijcai-asp/}
}