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
I characterize joint choice behavior generated by the pure strategy Nash equilib-rium solution conce...
This paper examines the existence of strategic solutions for finite normal form games under the assu...
AbstractWe present an infinite-game characterization of the well-founded semantics for function-free...
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-or...
AbstractWe introduce strategy logic, a logic that treats strategies in two-player games as explicit ...
Abstract. We present a framework for decision making with circumstance-dependent preferences and dec...
AbstractThis paper introduces nondeterminism into logic programs with negation by associating functi...
Through examples this chapter illuminates the features that distinguish the ‘con-sistent preferences...
This paper introduces a new solution concept for games with incomplete preferences. The concept is b...
We prove the existence of equilibria in games with players who employ abstract (non-binary) choice r...
Boolean games provide a simple, compact, and theoretically attractive abstract model for studying mu...
In this paper we present a framework for logic programming agents to take part in games in such a wa...
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each pl...
We introduce a Game Logic with Preferences (GLP), which makes it possible to reason about how inform...
We introduce language-based games, in which utility is defined over descriptions in a given language...
I characterize joint choice behavior generated by the pure strategy Nash equilib-rium solution conce...
This paper examines the existence of strategic solutions for finite normal form games under the assu...
AbstractWe present an infinite-game characterization of the well-founded semantics for function-free...
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-or...
AbstractWe introduce strategy logic, a logic that treats strategies in two-player games as explicit ...
Abstract. We present a framework for decision making with circumstance-dependent preferences and dec...
AbstractThis paper introduces nondeterminism into logic programs with negation by associating functi...
Through examples this chapter illuminates the features that distinguish the ‘con-sistent preferences...
This paper introduces a new solution concept for games with incomplete preferences. The concept is b...
We prove the existence of equilibria in games with players who employ abstract (non-binary) choice r...
Boolean games provide a simple, compact, and theoretically attractive abstract model for studying mu...
In this paper we present a framework for logic programming agents to take part in games in such a wa...
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each pl...
We introduce a Game Logic with Preferences (GLP), which makes it possible to reason about how inform...
We introduce language-based games, in which utility is defined over descriptions in a given language...
I characterize joint choice behavior generated by the pure strategy Nash equilib-rium solution conce...
This paper examines the existence of strategic solutions for finite normal form games under the assu...
AbstractWe present an infinite-game characterization of the well-founded semantics for function-free...