A proof theoretical approach to default reasoning I: tableaux for default logic
From MaRDI portal
Publication:4880541
DOI10.1093/logcom/6.2.205zbMath0859.03027OpenAlexW2016171120MaRDI QIDQ4880541
Luigia Carlucci Aiello, Giambattista Amati, Fiora Pirri, Dov M. Gabbay
Publication date: 7 April 1997
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1bfa635615dfbdc9afbf44abae6353c3b846ae22
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (11)
A Propositional Tableaux Based Proof Calculus for Reasoning with Default Rules ⋮ Defaults as restrictions on classical Hilbert-style proofs ⋮ Abduction as deductive saturation: a proof-theoretic inquiry ⋮ A sequent calculus for skeptical Default Logic ⋮ Proof complexity of propositional default logic ⋮ Sequent calculi for default and autoepistemic logics ⋮ Proof Complexity of Non-classical Logics ⋮ A tableaux calculus for default intuitionistic logic ⋮ Prolog technology for default reasoning: proof theory and compilation techniques ⋮ Seminormalizing a default theory ⋮ A uniform tableaux method for nonmonotonic modal logics
This page was built for publication: A proof theoretical approach to default reasoning I: tableaux for default logic
