Advertisement

Contradiction removal semantics with explicit negation

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

Abstract

Well Founded Semantics for logic programs extended with eXplicit negation (WFSX) is characterized by the fact that, in any model, whenever ¬ia (the explicit negation of a) holds, then ∼ a (the negation by default of a) also holds.

When explicit negation is used, contradictions may be present (e.g., a and ¬ia both hold for some a). We introduce a way the notion of removing some contradictions through identifying the set of models obtained by revising closed world assumptions. One such unique model is singled out as the contradiction removal semantics (CRSX). When contradictions do not arise, the contradiction removal semantics coincides with WFSX.

Keywords

Logic Program Inference Rule Default Theory Nonmonotonic Reasoning Stable Model Semantic 
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: K. Apt (ed.), IJCSLP'92, MIT Press (1992) 574–588.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.), LPNMR'91, MIT Press (1991) 120–132.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 (September 1990) 579–597.Google Scholar
  5. Inoue, K.: “Extended logic programs with default assumptions,” in: Koichi Furukawa (ed.), ICLP'91, MIT Press (1991) 490–504.Google Scholar
  6. Kowalski, R.: “Problems and promises of computational logic,” in: John Lloyd (ed.), Computational Logic Symposium, Springer-Verlag (1990) 1–36.Google Scholar
  7. Kowalski, R., and F. Sadri: “Logic programs with exceptions,” in: Warren and Szeredi (eds.), ICLP, MIT Press (1990) 598–613.Google Scholar
  8. Lloyd, J.W.: Foundations of Logic Programming. Symbolic Computation. Springer-Verlag, 1984.Google Scholar
  9. Pereira, L.M. and J.J. Alferes: “Well founded semantics for logic programs with explicit negation,” in: B. Neumann (ed.), ECAI'92, John Wiley & Sons, Ltd. (1992) 102–106.Google Scholar
  10. Pereira, L.M., J.J. Alferes, and J.N. Aparício: “Contradiction Removal within Well Founded Semantics,” in: A. Nerode, W. Marek, and V.S. Subrahmanian 102–106. (eds.) LPNMR, MIT Press (1991a) 105–119.Google Scholar
  11. Pereira, L.M., J.J. Alferes, and J.N. Aparício: “The extended stable models of contradiction removal semantics,” in: P.B arahona, L.M. Pereira, and A. Porto (eds.) EPIA'91, LNAI 541, Springer-Verlag (1991b) 105–119.Google Scholar
  12. Pereira, L.M., J.J. Alferes, and J.N. Aparício: “Default theory for well founded semantics with explicit negation,” in: D. Pearce and G. Wagner (eds.) Logics for AI-JELIA'92, LNAI 633, Springer-Verlag (1992a) 339–356.Google Scholar
  13. Pereira, L.M., J.J. Alferes, and J.N. Aparício: “Well founded semantics with explicit negation and default theory,” Technical report, AI Centre, Uninova, March 1992 (Submitted).Google Scholar
  14. 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, (1991c), 566–580.Google Scholar
  15. Pereira, L.M., J.N. Aparício, and J.J. Alferes: “Hypothetical reasoning with well founded semantics,” in: B. Mayoh (ed.), Third Scandinavian Conf. on AI. IOS Press, 1991d.Google Scholar
  16. Pereira, L.M., J.N. Aparício, and J.J. Alferes: “Nonmonotonic reasoning with well founded semantics,” in: K. Furukawa (ed.), ICLP91, MIT Press (1991e) 475–489.Google Scholar
  17. Pereira, L.M., J.N. Aparício, and J.J. Alferes: “Non-monotonic reasoning with logic programming,” in: Journal of Logic Programming. Special issue on Nonmonotonic reasoning, 1993 (to appear).Google Scholar
  18. Pereira, L.M., J.N. Aparício, and J.J. Alferes: “Logic Programming for Non-Monotonic Reasoning.” In this volume Google Scholar
  19. Przymusinska, H., and T. Przymusinski: “Semantic issues in deductive databases and logic programs,” in: R. Banerji (ed.), Formal Techniques in Artificial Intelligence. North Holland, 1990.Google Scholar
  20. Przymusinski, T.: “Extended stable semantics for normal and disjunctive programs,” in: Warren and Szeredi (eds.), ICLP'90, MIT Press (1990) 459–477.Google Scholar
  21. 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
  22. VanGelder, A., K.A. Ross, and J.S. Schlipf: “The well-founded semantics for general logic programs,” in: Journal of the ACM, 38 (3) (1991) 620–650.Google Scholar
  23. 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
  • José J. Alferes
    • 1
    • 2
  • Joaquim N. Aparício
    • 1
    • 2
  1. 1.CRIA, UninovaPortugal
  2. 2.DCS, U. Nova de LisboaMonte da CaparicaPortugal

Personalised recommendations