44 search results - page 2 / 9 » Formula Caching in DPLL |
SAT
2004
Springer
13 years 11 months ago
2004
Springer
FROCOS
2009
Springer
14 years 24 days 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...
C3S2E
2010
ACM
13 years 7 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
SAT
2009
Springer
14 years 23 days ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
CADE
2003
Springer
14 years 6 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...