40 search results - page 1 / 8 » Better algorithms for satisfiability problems for formulas o... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
JAL
2000
13 years 8 months ago
2000
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
SAT
2005
Springer
14 years 2 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...