881 search results - page 10 / 177 » Solving satisfiability problems with preferences |
CP
2000
Springer
14 years 6 days ago
2000
Springer
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
DATE
2000
IEEE
14 years 1 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
EUSFLAT
2007
13 years 10 months ago
2007
While considering processes of decision making we often encounter the problem of incomplete information. In group decision making (GDM) problems each decision maker is supposed to...
KBSE
2010
IEEE
13 years 7 months ago
2010
IEEE
The installation of software packages depends on the correct resolution of dependencies and conflicts between packages. This problem is NP-complete and, as expected, is a hard ta...