Sequent calculi for default and autoepistemic logics

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

Authors 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)

Recommendations

• Sequent calculi for propositional nonmonotonic logics
• A sequent calculus for skeptical Default Logic
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• Axiomatization of credulous reasoning in rational default logic
• The complexity of theorem proving in autoepistemic logic

Cites work

• scientific article; zbMATH DE number 4200176 (Why is no real title available?)
• scientific article; zbMATH DE number 4210100 (Why is no real title available?)
• scientific article; zbMATH DE number 4075021 (Why is no real title available?)
• scientific article; zbMATH DE number 4104920 (Why is no real title available?)
• scientific article; zbMATH DE number 33417 (Why is no real title available?)
• scientific article; zbMATH DE number 176757 (Why is no real title available?)
• scientific article; zbMATH DE number 3066797 (Why is no real title available?)
• A circumscriptive theorem prover
• A formal system for the non-theorems of the propositional calculus
• A logic for default reasoning
• A proof theoretical approach to default reasoning I: tableaux for default logic
• All I know: A study in autoepistemic logic
• Autoepistemic logic programming
• Circumscription - a form of non-monotonic reasoning
• Nonmonotonic reasoning, preferential models and cumulative logics
• Semantical considerations on nonmonotonic logic
• Tableau-based characterization and theorem proving for default logic
• Tableaux and sequent calculus for minimal entailment
• The method of axiomatic rejection for the intuitionistic propositional logic
• Theory of rejected propositions. I
• Transition system specifications with negative premises

Cited in

(17)

• Proof complexity of propositional default logic
• scientific article; zbMATH DE number 1301756 (Why is no real title available?)
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• A sequent-type calculus for three-valued default logic, or: Tweety meets quartum non datur
• Axiomatization of credulous reasoning in rational default logic
• Refutation systems: an overview and some applications to philosophical logics
• A sequent calculus for skeptical reasoning in predicate default logic (extended abstract)
• Sequent Calculus for Intuitionistic Epistemic Logic IEL
• Sequent calculi for propositional nonmonotonic logics
• Alternative foundations for Reiter's default logic
• A nonmonotonic modal relevant sequent calculus
• A sequent calculus for skeptical Default Logic
• The complexity of theorem proving in autoepistemic logic
• Uniform semantic treatment of default and autoepistemic logics
• Prolog technology for default reasoning: proof theory and compilation techniques
• Sequent-type rejection systems for finite-valued non-deterministic logics
• Proof complexity of propositional default logic

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)