The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Strong and Weak Constraints in Disjunctive Datalog
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Dynamic Decision-Making in Logic Programming and Game Theory
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Logic for Modeling Decision Making with Dynamic Preferences
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Dynamically Ordered Probabilistic Choice Logic Programming
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
LAIMA: a multi-agent platform using ordered choice logic programming
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.00 |
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.