422 search results - page 60 / 85 » Multithreaded SAT Solving |
CP
2005
Springer
14 years 3 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
CP
2000
Springer
14 years 1 months 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...
AIPS
2006
13 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...
IPL
2006
13 years 9 months ago
2006
We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O(nm dn/3) t...
RTA
2011
Springer
13 years 20 days ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...