Skip to main content
SpringerLink
Log in

Seminormal stratified default theories

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

In this paper we study seminormal default theories. The notions of stratification and strong stratification are introduced. The properties of stratified and strongly stratified default theories are investigated. We show how to determine if a given seminormal default theory is strongly stratified and how to find the finest partition into strata. We present algorithms for computing extensions for stratified seminormal default theories and analyze their complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Apt and H.A. Blair, Arithmetical classification of perfect models of stratified programs.Fundamenta Informaticae 12 (1990) 1.

    Google Scholar 

  2. K. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1987) p. 89.

    Google Scholar 

  3. Ph. Besnard,An Introduction to Default Logic (Springer-Verlag, 1989).

  4. N. Bidoit and Ch. Froidevaux, General logical databases and programs: Default logic semantics and stratification,Information and Computation 91 (1991) 15.

    Google Scholar 

  5. D.W. Etherington,Reasoning with Incomplete Information (Pitman, 1988).

  6. M. Gelfond, On stratified autoepistemic theories,Proceedings of AAAI-87 (Morgan Kaufmann, Los Altos, CA) p. 207.

  7. H.A. Kautz and B. Selman, Hard problems for simple default logics,Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, eds. R.J. Branchman, H.J. Levesque and R. Reiter (Morgan Kaufmann, San Mateo, CA, 1989) p. 189.

    Google Scholar 

  8. W. Marek and M. Truszczyński, Autoepistemic logic,Journal of the ACM 38 (1991) 588.

    Google Scholar 

  9. W. Marek and M. Truszczyński,Nonmonotonic Logics; Context-Dependent Reasoning (Springer-Verlag, 1993).

  10. R. Reiter, A logic for default reasoning,Artificial Intelligence 13 (1980) 81.

    Google Scholar 

  11. M. Truszczyński, Stratified modal theories and iterative expansions, Technical Report 159-90, Department of Computer Science, University of Kentucky (1990).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kentucky, 40506, Lexington, KY, USA

    Paweł Cholewiński

Authors
  1. Paweł Cholewiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cholewiński, P. Seminormal stratified default theories. Ann Math Artif Intell 17, 213–234 (1996). https://doi.org/10.1007/BF02127969

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02127969

Keywords

Search

Navigation