Sciweavers

573 search results - page 12 / 115
» Planning as Satisfiability with Preferences
Sort
View
IBPRIA
2009
Springer
14 years 7 days ago
Inference and Learning for Active Sensing, Experimental Design and Control
In this paper we argue that maximum expected utility is a suitable framework for modeling a broad range of decision problems arising in pattern recognition and related fields. Exa...
Hendrik Kück, Matthew Hoffman, Arnaud Doucet,...
INFFUS
2006
137views more  INFFUS 2006»
13 years 7 months ago
Bipolar possibility theory in preference modeling: Representation, fusion and optimal solutions
The bipolar view in preference modeling distinguishes between negative and positive preferences. Negative preferences correspond to what is rejected, considered unacceptable, whil...
Salem Benferhat, Didier Dubois, Souhila Kaci, Henr...
WINE
2010
Springer
109views Economy» more  WINE 2010»
13 years 5 months ago
Strategy-Proof Voting Rules over Multi-issue Domains with Restricted Preferences
In this paper, we characterize strategy-proof voting rules when the set of alternatives has a multi-issue structure, and the voters' preferences are represented by acyclic CP-...
Lirong Xia, Vincent Conitzer
INTERACT
1997
13 years 9 months ago
The Role of Culture in Interface Acceptance
In order for global software to be marketed successfully, the design of interfaces should accommodate users’ cultural differences. This study examines users’ culturally specifi...
Vanessa Evers, Donald L. Day
C3S2E
2010
ACM
13 years 8 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire