Sequent calculi for propositional nonmonotonic logics

DOI10.1145/505372.505374zbMath1365.03023OpenAlexW2019738341MaRDI QIDQ5738955

Nicola Olivetti, Piero A. Bonatti

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/505372.505374

zbMATH Keywords

autoepistemic logicdefault logicsequent calculicircumscriptionrejection methods

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27)

Related Items (11)

From input/output logics to conditional logics via sequents -- with provers ⋮ On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\) ⋮ Semantical considerations on multiagent only knowing ⋮ Sequent-type rejection systems for finite-valued non-deterministic logics ⋮ Unnamed Item ⋮ Paraconsistency in classical logic ⋮ Proof Complexity of Non-classical Logics ⋮ The Complexity of Reasoning for Fragments of Default Logic ⋮ Validities, antivalidities and contingencies: a multi-standard approach ⋮ Sequent calculi for choice logics ⋮ Sequent-calculi for metainferential logics

This page was built for publication: Sequent calculi for propositional nonmonotonic logics