Sciweavers

674 search results - page 9 / 135
» Preferences in Game Logics
Sort
View
LPNMR
2004
Springer
14 years 1 months ago
Planning with Preferences Using Logic Programming
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
Tran Cao Son, Enrico Pontelli
SEBD
2008
159views Database» more  SEBD 2008»
13 years 9 months ago
Profiling Sets for Preference Querying
We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences o...
Xi Zhang, Jan Chomicki
CIE
2007
Springer
14 years 1 months ago
Nash Stability in Additively Separable Hedonic Games Is NP-Hard
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...
Martin Olsen
SUM
2009
Springer
14 years 6 days ago
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
We propose a framework to compute the utility of an agreement w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formula...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
ATAL
2006
Springer
13 years 11 months ago
On the logic of coalitional games
We develop a logic for representing and reasoning about coalitional games without transferable payoffs. Although a number of logics of cooperation have been proposed over the past...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...