Skip to main content
SpringerLink
Log in

Order and Negation as Failure

  • Conference paper
Logic Programming (ICLP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2916))

Included in the following conference series:

Abstract

We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a convenient formulation of certain problems, which is illustrated by means of an intuitive simulation of logic programming with ordered disjunction. The simulation also supports a broader application of “ordered disjunction”, handling problems that would be cumbersome to express using ordered disjunction logic programs.

Interestingly, allowing negation as failure in ordered logic programs does not yield any extra computational power: the combination of negation as failure and order can be simulated using order (and true negation) alone.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brewka, G.: Logic programming with ordered disjunction. In: Proc. of the 18th AAAI Conf., pp. 100–105. AAAI Press, Menlo Park (2002)

    Google Scholar 

  2. Brewka, G., Benferhat, S., Le Berre, D.: Qualitative choice logic. In: Proc. of the 8th Intl. Conf. on Knowledge Representation and Reasoning, pp. 158–169. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  3. Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artificial Intelligence 109(1-2), 297–356 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Brewka, G., Niemela, I., Syrjanen, T.: Implementing ordered disjunction using answer set solvers for normal programs. In: Flesca et al. [10], pp. 444–455

    Google Scholar 

  5. Buccafurri, F., Faber, W., Leone, N.: Disjunctive logic programs with inheritance. In: De Schreye, D. (ed.) Proc. of the Intl. Conf. on Logic Programming, pp. 79–93. MIT Press, Cambridge (1999)

    Google Scholar 

  6. Buccafurri, F., Leone, N., Rullo, P.: Disjunctive ordered logic: Semantics and expressiveness. In: Cohn, A., et al. (eds.) Proc. of the 6th Intl. Conf. on Principles of Knowledge Representation and Reasoning, pp. 418–431. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  7. Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, New York (1978)

    Google Scholar 

  8. De Vos, M., Vermeir, D.: Dynamically ordered probabilistic choice logic programming. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 227–239. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Eiter, T., Gottlob, G., Leone, N.: Abduction from logic programs: Semantics and complexity. Theoretical Computer Science 189(1-2), 129–177 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  10. Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.): JELIA 2002. LNCS (LNAI), vol. 2424. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  11. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., et al. (eds.) Proc. of the 5th Intl. Conf. on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  12. Inoue, K., Sakama, C.: On positive occurrences of negation as failure. In: Doyle, J., et al. (ed.) Proc. of the 4th Intl. Conf. on Principles of Knowledge Representation and Reasoning, pp. 293–304. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  13. Inoue, K., Sakama, C.: A fixpoint characterization of abductive logic programs. Journal of Logic Programming 27(2), 107–136 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  14. Inoue, K., Sakama, C.: Negation as failure in the head. Journal of Logic Programming 35(1), 39–78 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kakas, C., Kowalski, R.A., Toni, F.: Abductive logic programming. Journal of Logic and Computation 2(6), 719–770 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kowalski, R.A., Sadri, F.: Logic programs with exceptions. In: Warren, D.H.D., Szeredi, P. (eds.) Proc. of the 7th Intl. Conf. on Logic Programming, pp. 598–613. The MIT Press, Cambridge (1990)

    Google Scholar 

  17. Laenens, E., Vermeir, D.: A fixpoint semantics of ordered logic. Journal of Logic and Computation 1(2), 159–185 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  18. Laenens, E., Vermeir, D.: Assumption-free semantics for ordered logic programs: On the relationship between well-founded and stable partial models. Journal of Logic and Computation 2(2), 133–172 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  19. Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135(2), 69–112 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lifschitz, V.: Answer set programming and plan generation. Journal of Artificial Intelligence 138(1-2), 39–54 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. Przymusinski, T.C.: Stable semantics for disjunctive programs. New Generation Computing 9(3-4), 401–424 (1991)

    Article  Google Scholar 

  22. Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence 32(1), 57–95 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  23. Sakama, C., Inoue, K.: An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning 13(1), 145–172 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  24. Sakama, C., Inoue, K.: Representing priorities in logic programs. In: Maher, M.J. (ed.) Proc. of the Intl. Conf. on Logic Programming, pp. 82–96. MIT Press, Cambridge (1996)

    Google Scholar 

  25. van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. In: Proc. of the 7th PODS Symposium, pp. 221–230. ACM Press, New York (1988)

    Google Scholar 

  26. Van Nieuwenborgh, D., Vermeir, D.: Order and negation as failure. Technical report, Vrije Universiteit Brussel, Dept. of Computer Science (2003)

    Google Scholar 

  27. Van Nieuwenborgh, D., Vermeir, D.: Preferred answer sets for ordered logic programs. In: Flesca et al. [10], pp. 432–443

    Google Scholar 

  28. Wang, K., Zhou, L., Lin, F.: Alternating fixpoint theory for logic programs with priority. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 164–178. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Vrije Universiteit Brussel, VUB,  

    Davy Van Nieuwenborgh & Dirk Vermeir

Authors
  1. Davy Van Nieuwenborgh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dirk Vermeir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ecole Polytechnique, Rue de Saclay, 91128, Palaiseau Cedex, France

    Catuscia Palamidessi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Nieuwenborgh, D., Vermeir, D. (2003). Order and Negation as Failure. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24599-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20642-2

  • Online ISBN: 978-3-540-24599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation