Analytic tableaux calculi for KLM logics of nonmonotonic reasoning-Reference-Cited by-同舟云学术

Analytic tableaux calculi for KLM logics of nonmonotonic reasoning

Published:2009-04 Issue:3 Volume:10 Page:1-47
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Giordano Laura¹,Gliozzi Valentina²,Olivetti Nicola³,Pozzato Gian Luca²

Affiliation:

1. Università del Piemonte Orientale “A. Avogadro”, Alessandria, Italy

2. Università degli Studi di Torino, Turin, Italy

3. Université Paul Cézanne, Marseille, France

Abstract

We present tableau calculi for the logics of nonmonotonic reasoning defined by Kraus, Lehmann and Magidor (KLM). We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative, and rational logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. We provide a decision procedure for the logics considered and we study their complexity.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/1507244.1507248

Reference33 articles.

1. General patterns for nonmonotonic reasoning: from basic entailments to plausible relations

2. Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations

3. leanTAP: Lean tableau-based deduction

4. Logic programming as a basis for lean automated deduction

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sequents vs Hypersequents for Åqvist Systems;Lecture Notes in Computer Science;2024

2. Dyadic Obligations: Proofs and Countermodels via Hypersequents;PRIMA 2022: Principles and Practice of Multi-Agent Systems;2022-11-12

3. Principles of KLM-style Defeasible Description Logics;ACM Transactions on Computational Logic;2021-01-31

4. A reconstruction of multipreference closure;Artificial Intelligence;2021-01

5. From Input/Output Logics to Conditional Logics via Sequents – with Provers;Lecture Notes in Computer Science;2021