25 search results - page 1 / 5 » Formal Correctness Proof for DPLL Procedure |
INFORMATICALT
2010
13 years 2 months ago
2010
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veriļ...
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...
AIPS
2006
13 years 5 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
CADE
2002
Springer
14 years 4 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
CL
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Many key veriļ¬cation problems such as boundedmodel-checking,circuit veriļ¬cation and logical cryptanalysis are formalized with combined clausal and afļ¬ne logic (i.e....