Work

Strongly Analytic Calculi for KLM Logics with SMT-Based Prover

Year: 2024

Type: conference-paper

Abstract: We introduce modular calculi for the logics for nonmonotonic reasoning defined by Kraus, Lehmann, and Magidor, featuring a strengthened form of analyticity. Our calculi are used to determine the computational complexity for the logics C, CL, CM, P (and M), and fragments thereof. The calculi are encoded into SMT solvers, yielding an efficient prover with countermodel generation capabilities. Our work encompasses known results and introduces new findings, including co-NP-completeness and a more effective semantics for C.

DOI: 10.24963/kr.2024/27

Authors: Agata Ciabattoni, Clemens Eisenhofer, Dmitry Rozplokhas

Institution: TU Wien

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Funders: European Commission, Vienna Science and Technology Fund, Austrian Science Fund