Advertisement

Generalized predicate completion

  • Atsushi Togashi
  • Ben-Hui Hou
  • Shoichi Noguchi
Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 444)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Chang and Lee, 1973]
    Chang, C.L., and Lee, R.C.T., Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York and London, 1973.Google Scholar
  2. [Clark, 1978]
    Clark, K.L., Negation as Failure, in Logic and Databases, Gallaire, H. and Minker, J., Eds., Plenum Press, New York, pp. 293–322, 1978.Google Scholar
  3. [Hou et al, 1988]
    Hou, B.H., Togashi, A. and Noguchi, S., On the Reducibility of Circumscription, Preprint WGAI, IPSJ, Vol.88, No.44, pp. 27–35, 1988.Google Scholar
  4. [Lifschitz, 1985]
    Lifschitz, V., Computing Circumscription, Proc. Ninth International Joint Conference on Artificial Intelligence, Los Angeles, CA, pp. 121–127, 1985.Google Scholar
  5. [Lloyd, 1984]
    Lloyd, J.W., Foundations of Logic Programming, Springer, 1984.Google Scholar
  6. [McCarthy, 1980]
    McCarthy, J., Circumscription — A Form of Non-Monotonic Reasoning, Artificial Intelligence, Vol. 13, pp. 27–39, 1980.Google Scholar
  7. [McCarthy, 1986]
    McCarthy, J., Applications of Circumscription to Formalizing Common Sense Knowledge, Artificial Intelligence, Vol. 28, pp. 89–116, 1986.Google Scholar
  8. [Rabinov, 1989]
    Rabinov, A., A Generalization of Collapsible Cases of Circumscription, Artificial Intelligence, Vol.38, pp. 111–117, 1989.Google Scholar
  9. [Reiter, 1978]
    Reiter, R., On Closed World Data Bases, in: Logic and Databases, Gallaire, H. and Minker, J., Eds., Plenum, New York, pp. 56–76, 1978.Google Scholar
  10. [Reiter, 1980]
    Reiter, R., A Logic for Default Reasoning, Artificial Intelligence, Vol. 13, pp. 81–132, 1980.Google Scholar
  11. [Reiter, 1982]
    Reiter, R., Circumscription Implies Predicate Completion (Sometimes)., Proc. AAAI-82, pp. 418–420, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Atsushi Togashi
    • 1
  • Ben-Hui Hou
    • 1
  • Shoichi Noguchi
    • 1
  1. 1.Research Institute of Electrical CommunicationTohoku UniversityAoba, SendaiJapan

Personalised recommendations