Abstract
We define choice logic programs as negation-free datalog programs that allow rules to have exclusive-only disjunctions in the head. We show that choice programs are equivalent to semi-negative datalog programs, at least as far as stable models are concerned. 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.
Original language | English |
---|---|
Title of host publication | Computer Science Logic - 13th International Workshop, CSL 1999 - 8th Annual Conference of the EACSL, Proceedings |
Editors | Jörg Flum, Mario Rodriguez-Artalejo |
Publisher | Springer Verlag |
Pages | 266-276 |
Number of pages | 11 |
ISBN (Electronic) | 9783540481683 |
ISBN (Print) | 9783540665366 |
DOIs | |
Publication status | Published - 13 May 2003 |
Event | 13th International Workshop on Computer Science Logic, CSL 1999 and held as International Workshops on Computer Science Logic, EACSL 1999 - Madrid, Spain Duration: 20 Sept 1999 → 25 Sept 1999 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1683 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 13th International Workshop on Computer Science Logic, CSL 1999 and held as International Workshops on Computer Science Logic, EACSL 1999 |
---|---|
Country/Territory | Spain |
City | Madrid |
Period | 20/09/99 → 25/09/99 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1999.
Keywords
- Choice
- Game theory
- Logic programs
- Nondeterminism
- Stable model semantics
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science