Abstract
Circumscription, proposed by McCarthy, is a formalism of non-monotonic reasoning. Predicate completion is an approach, proposed by Clark, to closed world reasoning which assumes that given sufficient conditions on a predicate are also necessary. Reiter has shown that for clausal sentences which are Horn in a predicate p, the circumscription of p logically subsumes the predicate completion of p. In this paper, we present a generalized completion of a predicate p, which is appropriate for clausal sentences which are not Horn in p. The main results of this paper are: (1) for non-overlapping clausal sentences (which may not necessarily be Horn in the predicate p), the circumscription of p logically subsumes the generalized completion of p; (2) for non-overlapping clausal sentences which are collapsible wrt (with respect to) the predicate p, the generalized completion of p is even logically equivalent to the circumscription of p.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Chang, C.L., and Lee, R.C.T., Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York and London, 1973.
Clark, K.L., Negation as Failure, in Logic and Databases, Gallaire, H. and Minker, J., Eds., Plenum Press, New York, pp. 293–322, 1978.
Hou, B.H., Togashi, A. and Noguchi, S., On the Reducibility of Circumscription, Preprint WGAI, IPSJ, Vol.88, No.44, pp. 27–35, 1988.
Lifschitz, V., Computing Circumscription, Proc. Ninth International Joint Conference on Artificial Intelligence, Los Angeles, CA, pp. 121–127, 1985.
Lloyd, J.W., Foundations of Logic Programming, Springer, 1984.
McCarthy, J., Circumscription — A Form of Non-Monotonic Reasoning, Artificial Intelligence, Vol. 13, pp. 27–39, 1980.
McCarthy, J., Applications of Circumscription to Formalizing Common Sense Knowledge, Artificial Intelligence, Vol. 28, pp. 89–116, 1986.
Rabinov, A., A Generalization of Collapsible Cases of Circumscription, Artificial Intelligence, Vol.38, pp. 111–117, 1989.
Reiter, R., On Closed World Data Bases, in: Logic and Databases, Gallaire, H. and Minker, J., Eds., Plenum, New York, pp. 56–76, 1978.
Reiter, R., A Logic for Default Reasoning, Artificial Intelligence, Vol. 13, pp. 81–132, 1980.
Reiter, R., Circumscription Implies Predicate Completion (Sometimes)., Proc. AAAI-82, pp. 418–420, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Togashi, A., Hou, BH., Noguchi, S. (1990). Generalized predicate completion. In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018387
Download citation
DOI: https://doi.org/10.1007/BFb0018387
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52850-0
Online ISBN: 978-3-540-47168-4
eBook Packages: Springer Book Archive