881 search results - page 29 / 177 » Solving satisfiability problems with preferences |
AIPS
2006
14 years 11 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
101
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
IEEESCC
2009
IEEE
15 years 4 months ago
2009
IEEE
In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components tha...
AAAI
1997
14 years 11 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
84
Voted
SIGECOM
2003
ACM
15 years 2 months ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...