On the role of negation in choice logic programs

Marina De Vos; Dirk Vermeir

doi:10.1007/3-540-46767-X_17

On the role of negation in choice logic programs

Vrije Universiteit Brussel

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

9 Citations (SciVal)

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.

Original language	English
Title of host publication	Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings
Editors	Nicola Leone, Gerald Pfeifer, Michael Gelfond
Publisher	Springer Verlag
Pages	236-245
Number of pages	10
ISBN (Electronic)	9783540467670
ISBN (Print)	9783540667490
DOIs	https://doi.org/10.1007/3-540-46767-X_17
Publication status	Published - 3 Mar 2000
Event	5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999 - El Paso, USA United States Duration: 2 Dec 1999 → 4 Dec 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1730
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999
Country/Territory	USA United States
City	El Paso
Period	2/12/99 → 4/12/99

Bibliographical note

Funding Information:
This research was partially supported by Gnsaga of CNR.

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

Keywords

Choice
Game-theory
Logic programming
Unfounded sets

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-46767-X_17

Cite this

De Vos, M., & Vermeir, D. (2000). On the role of negation in choice logic programs. In N. Leone, G. Pfeifer, & M. Gelfond (Eds.), Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings (pp. 236-245). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1730). Springer Verlag. https://doi.org/10.1007/3-540-46767-X_17

On the role of negation in choice logic programs. / De Vos, Marina; Vermeir, Dirk.
Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings. ed. / Nicola Leone; Gerald Pfeifer; Michael Gelfond. Springer Verlag, 2000. p. 236-245 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1730).

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

De Vos, M & Vermeir, D 2000, On the role of negation in choice logic programs. in N Leone, G Pfeifer & M Gelfond (eds), Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1730, Springer Verlag, pp. 236-245, 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999, El Paso, USA United States, 2/12/99. https://doi.org/10.1007/3-540-46767-X_17

De Vos M, Vermeir D. On the role of negation in choice logic programs. In Leone N, Pfeifer G, Gelfond M, editors, Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings. Springer Verlag. 2000. p. 236-245. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Epub 2000 Jan 1. doi: 10.1007/3-540-46767-X_17

De Vos, Marina ; Vermeir, Dirk. / On the role of negation in choice logic programs. Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings. editor / Nicola Leone ; Gerald Pfeifer ; Michael Gelfond. Springer Verlag, 2000. pp. 236-245 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a63b578f41a741978d2183aa65936ad3,

title = "On the role of negation in choice logic programs",

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.",

keywords = "Choice, Game-theory, Logic programming, Unfounded sets",

author = "{De Vos}, Marina and Dirk Vermeir",

note = "Funding Information: This research was partially supported by Gnsaga of CNR. Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999 ; Conference date: 02-12-1999 Through 04-12-1999",

year = "2000",

month = mar,

day = "3",

doi = "10.1007/3-540-46767-X_17",

language = "English",

isbn = "9783540667490",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "236--245",

editor = "Nicola Leone and Gerald Pfeifer and Michael Gelfond",

booktitle = "Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings",

address = "Germany",

}

TY - GEN

T1 - On the role of negation in choice logic programs

AU - De Vos, Marina

AU - Vermeir, Dirk

N1 - Funding Information: This research was partially supported by Gnsaga of CNR. Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 2000/3/3

Y1 - 2000/3/3

N2 - 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.

AB - 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.

KW - Choice

KW - Game-theory

KW - Logic programming

KW - Unfounded sets

UR - http://www.scopus.com/inward/record.url?scp=84958591878&partnerID=8YFLogxK

U2 - 10.1007/3-540-46767-X_17

DO - 10.1007/3-540-46767-X_17

M3 - Chapter in a published conference proceeding

AN - SCOPUS:84958591878

SN - 9783540667490

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 236

EP - 245

BT - Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings

A2 - Leone, Nicola

A2 - Pfeifer, Gerald

A2 - Gelfond, Michael

PB - Springer Verlag

T2 - 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999

Y2 - 2 December 1999 through 4 December 1999

ER -

On the role of negation in choice logic programs

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this