283 search results - page 27 / 57 » Solving Over-Constrained Problems with SAT |
SAT
2005
Springer
14 years 1 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
ICTAI
2003
IEEE
14 years 1 months ago
2003
IEEE
Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping t...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...
ICTAI
2002
IEEE
14 years 26 days ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C, Nov. 2002, p...