Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Jeřábek (2009)
Substitution Frege and extended Frege proof systems in non-classical logicsAnn. Pure Appl. Log., 159
S. Kraus, D.J. Lehmann, M. Magidor (1990)
Nonmonotonic reasoning, preferential models and cumulative logicsArtif. Intell., 44
J. Krajíček (1995)
Bounded Arithmetic, Propositional Logic, and Complexity Theory, vol. 60 of Encyclopedia of Mathematics and Its Applications
G. Antoniou (1999)
A tutorial on default logicsACM Comput. Surv., 31
G. Gottlob (1992)
Complexity results for nonmonotonic logicsJ. Log. Comput., 2
E. Jeřábek (2006)
Frege systems for extensible modal logicsAnn. Pure Appl. Log., 142
M.L. Bonet, T. Pitassi, R. Raz (2000)
On interpolation and automatization for Frege systemsSIAM J. Comput., 29
U. Egly, H. Tompits (2001)
Proof-complexity results for nonmonotonic reasoningACM Trans. Comput. Log., 2
V.W. Marek, M. Truszczyński (1993)
Nonmonotonic Logics—Context-Dependent Reasoning
S.A. Cook, R.A. Reckhow (1979)
The relative efficiency of propositional proof systemsJ. Symb. Log., 44
M. Cadoli, M. Schaerf (1993)
A survey of complexity results for nonmonotonic logicsJ. Log. Program., 17
P.A. Bonatti, N. Olivetti (2002)
Sequent calculi for propositional nonmonotonic logicsACM Trans. Comput. Log., 3
P. Hrubeš (2009)
On lengths of proofs in non-classical logicsAnn. Pure Appl. Log., 157
G. Amati, L.C. Aiello, D.M. Gabbay, F. Pirri (1996)
A proof theoretical approach to default reasoning I: tableaux for default logicJ. Log. Comput., 6
R. Reiter (1980)
A logic for default reasoningArtif. Intell., 13
M.L. Bonet, S.R. Buss, T. Pitassi (1995)
Feasible Mathematics II
G. Gentzen (1935)
Untersuchungen über das logische SchließenMathematische Zeitschrift, 39
V. Risch, C. Schwind (1994)
Tableaux-based characterization and theorem proving for default logicJ. Autom. Reason., 13
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 skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective. In particular, we show that the calculus for credulous reasoning obeys almost the same bounds on the proof size as Gentzen’s system LK. Hence proving lower bounds for credulous reasoning will be as hard as proving lower bounds for LK. On the other hand, we show an exponential lower bound to the proof size in Bonatti and Olivetti’s enhanced calculus for skeptical default reasoning.
Archive for Mathematical Logic – Springer Journals
Published: Jul 3, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.