Skip to main content
SpringerLink
Log in

On the Role of Negation in Choice Logic Programs

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1730))

Abstract

We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally model decision problems where, depending on a context, agents must make a decision, i.e. an exclusive choice out of several alternatives. It is shown that such a choice mechanism is in a sense equivalent with negation as supported in semi-negative (“normal”) datalog programs. We also discuss an application where strategic games can be naturally formulated as choice programs: it turns out that the stable models of such programs capture exactly the set of Nash equilibria.We then consider the effect of choice on “negative information” that may be implicitly derived from a program. Based on an intuitive notion of unfounded set for choice programs, we show that several results from (seminegative) disjunctive programs can be strengthened; characterizing the position of choice programs as an intermediate between simple positive programs and programs that allow for the explicit use of negation in the body of a rule.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Francesco Buccafurri, Nicola Leone and Pasquale Rullo. Strong and Weak Constraints in Disjunctive Datalog. In Jurgen Dix and Ulrich Furbach and Anil Nerode, editors, 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR’97), volume 1265 of Lecture Notes in Computer Science, pages 2–17. Springer.

    Google Scholar 

  2. Marina De Vos and Dirk Vermeir. Forcing in Disjunctive Logic Programs. In Kamal Karlapalem, Amin Y. Noaman and Ken Barker, editors, Proceedings of the Ninth International Conference on Information and Computation, pages 167–174, Winnipeg, Manitoba, Canada, June 1998.

    Google Scholar 

  3. Marina De Vos and Dirk Vermeir. Choice logic programs and Nash equilibria in strategic games. Accepted at Annual Conference of the European Association for Computer Science Logic (CSL99), September 20–25, 1999, Madrid, Spain. Published in Lecture Notes in Computer Science, Springer.

    Google Scholar 

  4. Allen Van Gelder, Kenneth A. Ross and John S. Schlipf. The Well-Founded Semantics for General Logic Programs. Journal of the Association for Computing Machinery, 38(3) (1991) 620–650.

    MATH  MathSciNet  Google Scholar 

  5. Nicola Leone, Pasquale Rullo and Francesco Scarello. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation. Journal of Information and Computation 135(2) (1997) 69–112.

    Article  MATH  Google Scholar 

  6. M. J. Osborne and A. Rubinstein. A Course in Game Theory, MIT Press,1994.

    Google Scholar 

  7. Carolina. Ruiz and Jack. Minker. Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs. Lecture Notes in Computer Science, 927(1995). Spinger

    Google Scholar 

  8. D. Sacca. Deterministic and Non-Deterministic Stable Models. Logic and Computation, 5 (1997) 555–579.

    Article  MathSciNet  Google Scholar 

  9. Chiaki Sakama and Katsumi Inoue An Alternative Approach to the Semantics of Disjunctive Logic Programs and Decductive Databases. Journal of Automated Reasoning, 13 (1994) 145–172.

    Article  MATH  MathSciNet  Google Scholar 

  10. D. Sacca and C. Zaniolo. Stable Models and Non-Determinism for Logic Programs with Negation. In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 205–218. Association for Computing Machinery, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Free University of Brussels, VUB Pleinlaan 2, Brussels, 1050, Belgium

    Marina De Vos & Dirk Vermeir

Authors
  1. Marina De Vos
    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. Department of Computer Science, University of Texas at El Paso, El Paso, TX, 79916, USA

    Michael Gelfond

  2. Institut für Informationssysteme 184/2, Technische Universität Wien, Favoritenstrβe 9-11, A-1040, Vienna, Austria

    Nicola Leone  & Gerald Pfeifer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Vos, M., Vermeir, D. (1999). On the Role of Negation in Choice Logic Programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-46767-X_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66749-0

  • Online ISBN: 978-3-540-46767-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation