Sequent calculi for default and autoepistemic logics

DOI10.1007/3-540-61208-4_9zbMATH Open1415.03055OpenAlexW1586926492MaRDI QIDQ4645232FDOQ4645232

P. A. Bonatti

Publication date: 10 January 2019

Published in: Theorem Proving with Analytic Tableaux and Related Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61208-4_9

zbMATH Keywords

nonmonotonic reasoningsequent calculusinference ruledefault logicdefault theory

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logics of knowledge and belief (including belief change) (03B42) Proof theory in general (including proof-theoretic semantics) (03F03) Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonmonotonic reasoning, preferential models and cumulative logics
• Theory of rejected propositions. I
• A logic for default reasoning
• Semantical considerations on nonmonotonic logic
• Circumscription - a form of non-monotonic reasoning
• All I know: A study in autoepistemic logic
• Transition system specifications with negative premises
• The method of axiomatic rejection for the intuitionistic propositional logic
• Tableau-based characterization and theorem proving for default logic
• A proof theoretical approach to default reasoning I: tableaux for default logic
• Tableaux and sequent calculus for minimal entailment
• A circumscriptive theorem prover
• A formal system for the non-theorems of the propositional calculus
• Autoepistemic logic programming

Cited In (9)

• Uniform semantic treatment of default and autoepistemic logics
• Refutation systems: an overview and some applications to philosophical logics
• Alternative foundations for Reiter's default logic
• Sequent Calculus for Intuitionistic Epistemic Logic IEL
• A sequent calculus for skeptical Default Logic
• Sequent-type rejection systems for finite-valued non-deterministic logics
• Prolog technology for default reasoning: proof theory and compilation techniques
• Proof complexity of propositional default logic
• Title not available (Why is that?)

This page was built for publication: Sequent calculi for default and autoepistemic logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645232)