100 search results - page 5 / 20 » sat 2005 |
113
Voted
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
176
Voted
AI
2005
Springer
15 years 3 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
101
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
110
Voted
ASPDAC
2005
ACM
15 years 9 months ago
2005
ACM
Abstract— Learning is an essential pruning technique in modern SAT solvers, but it exploits a relatively small amount of information that can be deduced from the conflicts. Rece...
135
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we overview our recent work and outline our current line of research: First, we describe the WCSP framework and its related local consistencies. Second, the Max-SAT p...