Abstract
Default logic is a nonstandard formal system, especially suitable for knowledge representation and commonsense reasoning. In this paper we study a class of propositional default theories for which computation of extensions simplifies. We introduce the notions of stratification and strong stratification. We investigate properties of stratified default theories. We show how to determine whether a given default theory is stratified or strongly stratified and how to find the finest partition into strata. We present algorithms for computing extensions for stratified default theories and analyze their complexity.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Apt and H.A. Blair. Arithmetical classification of perfect models of stratified programs. Fundamenta Informaticae, 12:1–17, 1990.
K. Apt, H.A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89–142, Los Altos, CA, 1987. Morgan Kaufmann.
N. Bidoit and Ch. Proidevaux. General logical databases and programs: Default logic semantics and stratification. Information and Computation, 91:15–54, 1991.
P. Cholewiński, W. Marek, A. Mikitiuk and M. Truszczyński. Experimenting with default logic In Proceedings of ICLP-95, MIT Press, to appear.
P. Cholewiński. Seminormal stratified default theories. Technical Report 238-93, University of Kentucky, Lexington, 1993.
D.W. Etherington. Reasoning with Incomplete Information. Pitman, London, 1988.
M. Gelfond. On stratified autoepistemic theories. In Proceedings of AAAI-87, pages 207–211, Los Altos, CA., 1987. American. Association for Artificial Intelligence, Morgan Kaufmann.
G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2:397–425, 1992.
H.A. Kautz and B. Selman. Hard problems for simple default logics. In Principles of Knowledge Representation and Reasoning, pages 189–197, San Mateo, CA., 1989. Morgan Kaufmann.
W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38:588–619, 1991.
W. Marek and M. Truszczyński. Nonmonotonic Logics; Context-Dependent Reasoning. Springer-Verlag, 1993.
I. Niemelä. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae, 1992.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.
M. Truszczyński. Stratified modal theories and iterative expansions. Technical Report 159-90, Department of Computer Science, University of Kentucky, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cholewiński, P. (1995). Stratified default theories. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022275
Download citation
DOI: https://doi.org/10.1007/BFb0022275
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60017-6
Online ISBN: 978-3-540-49404-1
eBook Packages: Springer Book Archive