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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
A. Baker and M. Ginsberg, A theorem prover for prioritized circumscription,Proc. IJCAI-89 (1989) pp. 463–467.
G. Bossi and P. Siegel, Saturation, nonmonotonic reasoning, and the closed-world assumption, Artificial Intelligence 25(1985)13–63.
D. Etherington, R. Mercer and R. Reiter, On the adequacy of predicate circumscription for closed-world reasoning, Comp. Intelligence 1(1) (1985).
D. Etherington,Reasoning with Incomplete Information (Pitman, London, 1988).
M. Gelfond and H. Przymusinska, Negation as failure: Careful closure procedure, Artificial Intelligence 30(1986)273–287.
M. Gelfond, H. Przymusinska and T. Przymusinski, On the relationship between circumscription and negation as failure, Artificial Intelligence 38(1989)75–94.
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.
M.R. Genesereth and N.J. Nilsson,Logical Foundations of Artificial Intelligence (Morgan Kaufmann, San Mateo, CA, 1987).
M. Ginsberg, A circumscriptive theorem prover, Artificial Intelligence 39(1989)209–230.
K. Inoue and N. Helft, On theorem provers for circumscription,Proc. CSCSI-90 (1990) pp. 212–219.
V. Lifschitz, Closed-world data bases and circumscription, Artificial Intelligence 27 (1985).
V. Lifschitz, On the satisfiability of circumscription, Artificial Intelligence 28 (1986).
R. Lyndon, Properties preserved under homomorphism, Pacific J. Math. 9(1959)143–154.
E. Marczewski, Sur les congruences et les proprietés positives d'algébres abstraites, Colloq. Math. 2(1951)220.
J. McCarthy, Circumscription — a form of non-monotonic reasoning, Artificial Intelligence 13(1980)27–39; 171–172. Reproduced in [16].
J. McCarthy,Formalizing Common Sense: Papers by John McCarthy (Ablex, Norwood, NJ, 1990).
J. Minker, On indefinite data bases and the closed world assumption,Proc. CADE-82 (1982) pp. 292–308.
J. Minker, Perspectives in deductive databases, J. Logic Program. 5(1988)33–60.
T. Przymusinki, An algorithm to compute circumscription, Artificial Intelligence 38(1989)49–73.
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.
M. Suchenek, A syntactic characterization of minimal entailment,Logic Programming: North American Conf., eds. E. Lusk and R. Overbeek (1989) pp. 81–91.
M. Suchenek, Applications of Lyndon homomorphism theorems to the theory of minimal models, Int. J. Found. Comp. Sci. 1(1990)49–59.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/BF01530823