Advertisement

Logic programming for non-monotonic reasoning

  • Luís Moniz Pereira
  • Joaquim N. Aparício
  • José J. Alferes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 808)

Abstract

Our purpose is to develop a modular systematic method of representing nonmonotonic reasoning problems with the Well Founded Semantics of extended logic programs augmented with eXplicit negation (WFSX), and augmented by its Contradiction Removal Semantics (CRSX) when needed. We show how to cast in the language of such logic programs forms of non-monotonic reasoning like defeasible reasoning and hypothetical reasoning, and apply them to different domains of knowledge representation, for instance taxonomic hierarchies and reasoning about actions. We then abstract a modular systematic method of representing non-monotonic problems in logic programming.

Keywords

Logic Program Logic Programming Default Theory Nonmonotonic Reasoning Dead Bird 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alferes, J.J., and L.M. Pereira: “On logic program semantics with two kinds of negation,” in: IJCSLP'92. MIT Press, 1992.Google Scholar
  2. Dung, P.M., and P. Ruamviboonsuk: “Well founded reasoning with classical negation,” in: A. Nerode, W. Marek, and V.S. Subrahmanian (eds.), Workshop on LPNMR. MIT Press, 1991.Google Scholar
  3. Gelfond, M., and V. Lifschitz: “The stable model semantics for logic programming,” in: R.A. Kowalski and K.A. Bowen (eds.), 5th ICLP, MIT Press (1988) 1070–1080.Google Scholar
  4. Gelfond, M., and V. Lifschitz: “Logic programs with classical negation,” in: Warren and Szeredi (eds.), ICLP, MIT Press (1990) 579–597.Google Scholar
  5. Hanks, S., and D. McDermott: “Default reasoning, nonmonotonic logics and the frame problem,” in: AAAI86 (1986) 328–333.Google Scholar
  6. Inoue, K.: “Extended logic programs with default assumptions,” in: K. Furukawa (ed.), 8th ICLP, MIT Press (1991) 490–504.Google Scholar
  7. Kautz, H.: “The logic of persistence,” in: AAAI'86 (1986) 401.Google Scholar
  8. Kowalski, R.: “Problems and promises of computational logic,” in: J. Lloyd (ed.), Computational Logic Symposium Springer-Verlag (1990) 1–36.Google Scholar
  9. Kowalski, R., and F. Sadri: “Logic programs with exceptions,” in: Warren and Szeredi (eds.), ICLP, MIT Press (1990) 598–613.Google Scholar
  10. Lifschitz, V.: “Pointwise circumscription,” in: AAAI'86 (1986) 406.Google Scholar
  11. Lloyd, J.W.: Foundations of Logic Programming. Symbolic Computation. Springer-Verlag, 1984.Google Scholar
  12. McCarthy, J., and P.J. Hayes: Some Philosophical Problems from the Standpoint of Artificial Intelligence. Readings in Nonmonotonic Reasoning. M. Kaufmann Inc. (1987) 26–45.Google Scholar
  13. Pereira, L.M., and J.J. Alferes: “Well founded semantics for logic programs with explicit negation,” in: ECAI'92. John Wiley & Sons, Ltd, 1992.Google Scholar
  14. Pereira, L.M., J.J. Alferes, and J.N. Aparício: “Contradiction removal semantics with explicit negation.” In this book.Google Scholar
  15. Pereira, L.M., J.J. Alferes, and J.N. Aparício: “Default theory for well founded semantics with explicit negation,” in: JELIA'92, 1992a.Google Scholar
  16. Pereira, L.M., J.J. Alferes, and J.N. Aparício: “Well founded semantics with explicit negation and default theory,” Technical report, AI Center, Uninova, 1992b. Submitted.Google Scholar
  17. Pereira, L.M., J.N. Aparício, and J.J. Alferes: “Counterfactual reasoning based on revising assumptions,” in: V. Saraswat and K. Ueda (eds.), ILPS, MIT Press (1991a) 566–580.Google Scholar
  18. Pereira, L.M., J.N. Aparício, and J.J. Alferes: “Hypothetical reasoning with well founded semantics,” in: B. Mayoh (ed.) Third Scandinavian Con. on AI. IOS Press, 1991b.Google Scholar
  19. Pereira, L.M., J.N. Aparício, and J.J. Alferes. “Nonmonotonic reasoning with well founded semantics,” in: K. Furukawa (ed.) ICLP91, MIT Press (1991c) 475–489.Google Scholar
  20. Poole, D.L.: “A logical framework for default reasoning,” in: Journal of AI, 36 (1), (1988) 27–47.Google Scholar
  21. Przymusinski, T.: “Extended stable semantics for normal and disjunctive programs,” in: Warren and Szeredi (eds.) ICLP90, MIT Press (1990) 459–477.Google Scholar
  22. Przymusinski, T.C.: “A semantics for disjunctive logic programs,” in: D. Loveland, J. Lobo, and A. Rajasekar (eds.), ILPS Workshop on Disjunctive Logic Programs, 1991.Google Scholar
  23. Shoham, Y.: Reasoning about Change: Time and Change from the Standpoint of Artificial Intelligence. MIT Press, 1988.Google Scholar
  24. VanGelder, A., K.A. Ross, and J.S. Schlipf: “The well-founded semantics for general logic programs,” in: Journal of the ACM (1990) 221–230.Google Scholar
  25. Wagner, G.: “A database needs two kinds of negation,” in: B. Thalheim, J. Demetrovics, and H-D. Gerhardt (eds.), MFDBS'91, Springer-Verlag (1991) 357–371.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Luís Moniz Pereira
    • 1
    • 2
  • Joaquim N. Aparício
    • 1
    • 2
  • José J. Alferes
    • 1
    • 2
  1. 1.CRIA, UninovaPortugal
  2. 2.DCS, U. Nova de LisboaMonte da CaparicaPortugal

Personalised recommendations