9 search results - page 1 / 2 » The Optimality of a Fast CNF Conversion and its Use with SAT |
SAT
2004
Springer
13 years 10 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...
FROCOS
2009
Springer
13 years 11 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...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
ETS
2010
IEEE
13 years 5 months ago
2010
IEEE
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
SAT
2010
Springer
13 years 3 months ago
2010
Springer
Previous work has shown that circuit representations can be exploited in QBF solvers to obtain useful performance improvements. In this paper we examine some additional techniques ...