2006/11/10 by Laura Giordano, Giordano, Laura, Valentina Gliozzi +5
Computer Science · #Advanced Algebra and Logic #Artificial Intelligence (cs.AI) #F.4.1 #FOS: Computer and information sciences #I.2.3 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0611046
54 pages + appendix with proofs
arxiv created 2006/11/10 · openalex publication_date 2006/11/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. 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.