Advertisement

Abstract

We present a new circumscription method, called discriminant circumscription, for first order theories described by clauses whose orientations are of primary importance in their applications. These applications have been primarily dominated by deductive databases and logic programs. We show that discriminant circumscription is equivalent to the stable model semantics of deductive databases. This method is therefore strictly more powerful than those previously proposed by Przymusinski and by Lifschitz.

Key words

Logic Programming with Negation Deductive Databases Nonmonotonic Reasoning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Clark K., Negation as Failure, in Logic and Databases, H. Gallaire and J. Minker (ed.), Plenum Press, New York, 1978, 293–322.Google Scholar
  2. 2.
    Doyle J., A Truth Maintenance System, Artificial Intelligence Vol. 12, (1979), 231–272.Google Scholar
  3. 3.
    Dung P. and K. Kanchanasut, A Fixpoint Approach to Declarative Semantics of Logic Programs, in Proc. North American Conference on Logic Programming, E. Lust and R. Overbeek (ed.), MIT Press, 1989, 604–625.Google Scholar
  4. 4.
    Dung P. and K. Kanchanasut, On the Generalized Predicate Completion of Non-Horn Program, in Proc. North American Conference on Logic Programming, E. Lust and R. Overbeek (ed.), MIT Press, 1989, 587–603.Google Scholar
  5. 5.
    Gelfond M. and V. Lifschitz, Compiling Circumscriptive Theories into Logic Programs, in Proc. 7th AAAI, 1988, 455–459.Google Scholar
  6. 6.
    Gelfond M. and V. Lifschitz, The Stable Model Semantics for Logic Programming, in Proc. 5th Symposium/Conference on Logic Programming, R. A. Kowalski and K. A. Bowen (ed.), MIT Press, 1988, 1070–1080.Google Scholar
  7. 7.
    Hanks S. and D. McDermott, Nonmonotonic Logic and Temporal Projection, Artificial Intelligence Vol. 33, (1987), 379–412.Google Scholar
  8. 8.
    Lifschitz V., Computing Circumscription, Proc. IJCAI-85, Los Angeles, CA, 1985, 121–127.Google Scholar
  9. 9.
    Lifschitz V., On the Declarative Semantics of Logic Programs with Negation, in Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufman Publishers, 1988, 177–192.Google Scholar
  10. 10.
    McCarthy J., Circumscription—A Form of Non-monotonic Reasoning, Artificial Intelligence Vol. 13, (1980), 27–39.Google Scholar
  11. 11.
    McCarthy J., Applications of Circumscription to Formalizing Common-Sense Reasoning, Artificial Intelligence Vol. 28, (1986), 86–116.Google Scholar
  12. 12.
    Morris P. H., The Anomalous Extension Problem in Default Reasoning, Artificial Intelligence Vol. 35, (1988), 383–399.Google Scholar
  13. 13.
    Przymusinski T., Non-monotonic Reasoning vs. Logic Programming: a New Perspective, in Formal Foundations of Artificial Intelligence, D. Patridge and Y. Wilks (ed.), 1988.Google Scholar
  14. 14.
    Przymusinski T., On the Declarative Semantics of Deductive Databases and Logic Programs, in Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufman Publishers, 1988, 193–216.Google Scholar
  15. 15.
    Przymusinski T., Three-Valued Formalizations of Non-monotonic Reasoning and Logic Programming, in Proc. First Int'l Conference on Principles of Knowledge, Representation, and Reasoning, Morgan Kaufmann, 1989, 341–348.Google Scholar
  16. 16.
    Przymusinski T. C., An Algorithm to Compute Circumscription, Artificial Intelligence Vol. 38, (1989), 47–73.Google Scholar
  17. 17.
    Shepherson J., Negation in Logic Programs, in Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufman Publishers, 1988, 19–88.Google Scholar
  18. 18.
    Van Gelder A., K. Ross and J. Schlipf, Unfounded Sets and Well-founded Semantics for General Logic Programs, in Proc. the 7th ACM PODS, 1988, 221–230.Google Scholar
  19. 19.
    You J. and L. Li, Supported Circumscription and Its Relation to Logic Programming with Negation, in Proc. North American Conference on Logic Programming, MIT Press, 1989.Google Scholar
  20. 20.
    Yuan L. and J. You, A New Circumscription Method for Stable Model Semantics, unpublished manuscript, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Li Yan Yuan
    • 1
  • Jia-Huai You
    • 1
  1. 1.Department of Computing ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations