Skip to main content
SpringerLink
Log in

ECWA made easy

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

Abstract

We generalize a theorem on the relation of theextended closed world assumption (ECWA) to circumscription due to Gelfond, Przymusinska and Przymusinski, and give a simple proof of the generalized result.

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. A. Baker and M. Ginsberg, A theorem prover for prioritized circumscription,Proc. IJCAI-89 (1989) pp. 463–467.

  2. G. Bossi and P. Siegel, Saturation, nonmonotonic reasoning, and the closed-world assumption, Artificial Intelligence 25(1985)13–63.

    Google Scholar 

  3. D. Etherington, R. Mercer and R. Reiter, On the adequacy of predicate circumscription for closed-world reasoning, Comp. Intelligence 1(1) (1985).

  4. D. Etherington,Reasoning with Incomplete Information (Pitman, London, 1988).

    Google Scholar 

  5. M. Gelfond and H. Przymusinska, Negation as failure: Careful closure procedure, Artificial Intelligence 30(1986)273–287.

    Google Scholar 

  6. M. Gelfond, H. Przymusinska and T. Przymusinski, On the relationship between circumscription and negation as failure, Artificial Intelligence 38(1989)75–94.

    Google Scholar 

  7. M. Gelfond, H. Przymusinska and T. Przymusinski, On the relationship between CWA, minimal model, and minimal Herbrand model semantics, Int. J. Intelligent Syst. 5(1990)549–564.

    Google Scholar 

  8. M.R. Genesereth and N.J. Nilsson,Logical Foundations of Artificial Intelligence (Morgan Kaufmann, San Mateo, CA, 1987).

    Google Scholar 

  9. M. Ginsberg, A circumscriptive theorem prover, Artificial Intelligence 39(1989)209–230.

    Google Scholar 

  10. K. Inoue and N. Helft, On theorem provers for circumscription,Proc. CSCSI-90 (1990) pp. 212–219.

  11. V. Lifschitz, Closed-world data bases and circumscription, Artificial Intelligence 27 (1985).

  12. V. Lifschitz, On the satisfiability of circumscription, Artificial Intelligence 28 (1986).

  13. R. Lyndon, Properties preserved under homomorphism, Pacific J. Math. 9(1959)143–154.

    Google Scholar 

  14. E. Marczewski, Sur les congruences et les proprietés positives d'algébres abstraites, Colloq. Math. 2(1951)220.

    Google Scholar 

  15. J. McCarthy, Circumscription — a form of non-monotonic reasoning, Artificial Intelligence 13(1980)27–39; 171–172. Reproduced in [16].

    Google Scholar 

  16. J. McCarthy,Formalizing Common Sense: Papers by John McCarthy (Ablex, Norwood, NJ, 1990).

    Google Scholar 

  17. J. Minker, On indefinite data bases and the closed world assumption,Proc. CADE-82 (1982) pp. 292–308.

  18. J. Minker, Perspectives in deductive databases, J. Logic Program. 5(1988)33–60.

    Google Scholar 

  19. T. Przymusinki, An algorithm to compute circumscription, Artificial Intelligence 38(1989)49–73.

    Google Scholar 

  20. R. Reiter, On closed world data bases, in:Logic and Data Bases, eds. H. Gallaire and J. Minker (Plenum Press, New York, 1978) pp. 119–140.

    Google Scholar 

  21. M. Suchenek, A syntactic characterization of minimal entailment,Logic Programming: North American Conf., eds. E. Lusk and R. Overbeek (1989) pp. 81–91.

  22. M. Suchenek, Applications of Lyndon homomorphism theorems to the theory of minimal models, Int. J. Found. Comp. Sci. 1(1990)49–59.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences and Department of Philosophy, University of Texas at Austin, 78712, Austin, TX, USA

    Vladimir Lifschitz

Authors
  1. Vladimir Lifschitz
    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

Lifschitz, V. ECWA made easy. Ann Math Artif Intell 14, 269–274 (1995). https://doi.org/10.1007/BF01530823

Download citation

  • Issue Date:

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

Keywords

Search

Navigation