Sequent calculi for default and autoepistemic logics
From MaRDI portal
Publication:4645232
DOI10.1007/3-540-61208-4_9zbMath1415.03055OpenAlexW1586926492MaRDI QIDQ4645232
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
Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (4)
Sequent-type rejection systems for finite-valued non-deterministic logics ⋮ A sequent calculus for skeptical Default Logic ⋮ Prolog technology for default reasoning: proof theory and compilation techniques ⋮ Alternative foundations for Reiter's default logic
Cites Work
- Transition system specifications with negative premises
- Tableaux and sequent calculus for minimal entailment
- The method of axiomatic rejection for the intuitionistic propositional logic
- Semantical considerations on nonmonotonic logic
- A circumscriptive theorem prover
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Nonmonotonic reasoning, preferential models and cumulative logics
- A formal system for the non-theorems of the propositional calculus
- Tableau-based characterization and theorem proving for default logic
- Autoepistemic logic programming
- All I know: A study in autoepistemic logic
- Theory of rejected propositions. I
- A proof theoretical approach to default reasoning I: tableaux for default logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sequent calculi for default and autoepistemic logics