Sequent calculi for propositional nonmonotonic logics
PA Bonatti, N Olivetti - ACM Transactions on Computational Logic …, 2002 - dl.acm.org
A uniform proof-theoretic reconstruction of the major nonmonotonic logics is introduced. It
consists of analytic sequent calculi where the details of nonmonotonic assumption making …
consists of analytic sequent calculi where the details of nonmonotonic assumption making …
Abduction as deductive saturation: a proof-theoretic inquiry
M Piazza, G Pulcini, A Sabatini - Journal of Philosophical Logic, 2023 - Springer
Abductive reasoning involves finding the missing premise of an “unsaturated” deductive
inference, thereby selecting a possible explanans for a conclusion based on a set of …
inference, thereby selecting a possible explanans for a conclusion based on a set of …
Sequent calculi for default and autoepistemic logics
PA Bonatti - International Workshop on Theorem Proving with …, 1996 - Springer
Two sequent calculi, for default logic and autoepistemic logic, will be introduced in this
paper. The main goal is improving our prooftheoretic understanding of non-monotonic …
paper. The main goal is improving our prooftheoretic understanding of non-monotonic …
A sequent calculus for skeptical default logic
PA Bonatti, N Olivetti - Automated Reasoning with Analytic Tableaux and …, 1997 - Springer
In this paper, we contribute to the proof-theory of Reiter's Default Logic by introducing a
sequent calculus for skeptical reasoning. The main features of this calculus are simplicity …
sequent calculus for skeptical reasoning. The main features of this calculus are simplicity …
Proof-complexity results for nonmonotonic reasoning
U Egly, H Tompits - ACM Transactions on Computational Logic (TOCL), 2001 - dl.acm.org
It is well-known that almost all nonmonotonic formalisms have a higher worst-case
complexity than classical reasoning. In some sense, this observation denies one of the …
complexity than classical reasoning. In some sense, this observation denies one of the …
Proof complexity of non-classical logics
Proof complexity is an interdisciplinary area of research utilising techniques from logic,
complexity, and combinatorics towards the main aim of understanding the complexity of …
complexity, and combinatorics towards the main aim of understanding the complexity of …
Prolog technology for default reasoning: proof theory and compilation techniques
T Schaub, S Brüning - Artificial Intelligence, 1998 - Elsevier
The aim of this work is to show how Prolog technology can be used for efficient
implementation of query answering in default logics. The idea is to translate a default theory …
implementation of query answering in default logics. The idea is to translate a default theory …
Tableaux for nonmonotonic logics
N Olivetti - Handbook of Tableau Methods, 1999 - Springer
In the last 15 years there has been a huge amount of research on logical formalization of
commonsense reasoning. One of the major difficulties against the use of standard logics for …
commonsense reasoning. One of the major difficulties against the use of standard logics for …
Proof complexity of propositional default logic
Default logic is one of the most popular and successful formalisms for non-monotonic
reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and …
reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and …
[PDF][PDF] A Sequent Calculus for Intuitionistic Default Logic.
U Egly, H Tompits - WLP, 1997 - Citeseer
Current research on non-monotonic reasoning shows growing interest on implementation
details, so the need for concrete calculi formalizing non-monotonic logics is clearly …
details, so the need for concrete calculi formalizing non-monotonic logics is clearly …