Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Proof complexity of propositional default logic

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 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Loading next page...
 
/lp/springer-journals/proof-complexity-of-propositional-default-logic-BEY0Ft0E1u

References (18)

Publisher
Springer Journals
Copyright
Copyright © 2011 by Springer-Verlag
Subject
Mathematics; Algebra; Mathematics, general; Mathematical Logic and Foundations
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/s00153-011-0245-8
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Archive for Mathematical LogicSpringer Journals

Published: Jul 3, 2011

There are no references for this article.