17 search results - page 2 / 4 » Improving Backtrack Search for SAT by Means of Redundancy |
CP
2003
Springer
13 years 10 months ago
2003
Springer
Recently spectacular improvements in the performance of SAT solvers have been achieved through nogood recording (clause learning). In the CSP literature, on the other hand, nogood ...
LPNMR
2004
Springer
13 years 11 months ago
2004
Springer
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
SAT
2005
Springer
13 years 11 months ago
2005
Springer
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
TIME
2002
IEEE
13 years 10 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
STACS
2005
Springer
13 years 11 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...