Abstract
A sound and complete sequent calculus for skeptical consequence in predicate default logic is presented. While skeptical consequence is decidable in the finite propositional case, the move to predicate or infinite theories increases the complexity of skeptical reasoning to being \(\Pi^{\rm 1}_{\rm 1}\)-complete. This implies the need for sequent rules with countably many premises, and such rules are employed.
This paper grew out of the author’s dissertation, written under the direction of Anil Nerode.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bonatti, P., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Trans. Comput. Log. 3, 226–278 (2002)
Reiter, R.: A logic for default reasoning. Art. Int. 13, 81–132 (1980)
Gelfond, M., Lifschitz, V.: The stable semantics for logic programs. In: Kowalski, R.A., Bowen, K.A. (eds.) Proceedings of the 5th Annual Symposium on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Moore, R.C.: Possible-world semantics for the autoepistemic logic. In: Reiter, R. (ed.) Proceedings of the Workshop on Non-Monotonic Reasoning, pp. 344–354 (1984)
Marek, V.W., Nerode, A., Remmel, J.B.: The stable models of a predicate logic program. J. Log. Prog. 21, 129–154 (1994)
Cenzer, D., Remmel, J.B.: \(\pi^{0}_1\) classes in mathematics. In: Ershov, Y.L., Goncharov, S.S., Marek, V.W., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, vol. 2, pp. 623–821. North-Holland, Amsterdam (1998)
Lifschitz, V.: On open defaults. In: Lloyd, J.W. (ed.) Computational Logic. Symposium Proceedings, pp. 80–95. Springer, Heidelberg (1990)
Milnikel, R.S.: The complexity of predicate default logic over a countable domain. Ann. Pure Appl. Log. 120, 151–163 (2003)
Bonatti, P.: A gentzen system for non-theorems. Technical Report CD-TR 93/52, Christian Doppler Labor für Expertensysteme (1993)
Barwise, J.: An introduction to first-order logic. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 5–46. North-Holland, Amsterdam (1977)
Artemov, S.N.: Explicit provability and constructive semantics. Bull. Symbolic Logic 7, 1–36 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milnikel, R.S. (2003). A Sequent Calculus for Skeptical Reasoning in Predicate Default Logic (Extended Abstract). In: Nielsen, T.D., Zhang, N.L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2003. Lecture Notes in Computer Science(), vol 2711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45062-7_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-45062-7_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40494-1
Online ISBN: 978-3-540-45062-7
eBook Packages: Springer Book Archive