101 search results - page 11 / 21 » sat 2009 |
CP
2009
Springer
14 years 10 months ago
2009
Springer
A problem that is inherent to the development and efficient use of solvers is that of tuning parameters. The CP community has a long history of addressing this task automatically. ...
FROCOS
2009
Springer
14 years 4 months ago
2009
Springer
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas natur...
ICTAI
2009
IEEE
14 years 4 months ago
2009
IEEE
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...
ICTAI
2009
IEEE
14 years 4 months ago
2009
IEEE
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
DDECS
2009
IEEE
14 years 4 months ago
2009
IEEE
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...