881 search results - page 30 / 177 » Solving satisfiability problems with preferences |
MOBIQUITOUS
2005
IEEE
14 years 2 months ago
2005
IEEE
Automatic adaptation of the environment to user preferences results in personalized ambients that fulfill user interaction requirements in a more suitable way. However, the proble...
DAC
2009
ACM
14 years 9 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
CPAIOR
2010
Springer
13 years 6 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
AMAI
2004
Springer
13 years 8 months ago
2004
Springer
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
CP
2007
Springer
14 years 2 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...