283 search results - page 3 / 57 » Solving Over-Constrained Problems with SAT |
238
Voted
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
156
Voted
SAT
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
179
Voted
SARA
2009
Springer
16 years 27 days ago
2009
Springer
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...
249
Voted
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
165
click to vote
AIPS
2006
15 years 7 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...