资源分类
》 资源 》论文》An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic

An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic

2019-09-29 | |  52 |   29 |   0
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).

上一篇：A Tractable, Expressive, and Eventually Complete First-Order Logic of Limited Belief

下一篇：Answer Set Programming for Judgment Aggregation

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...