1. Home
  2. Issues
  3. Volume 21, Issue 1 (2010)
  4. Formal Correctness Proof for DPLL Proced ...

Informatica


Cited by 5
Formal Correctness Proof for DPLL Procedure

Certifying Safety and Termination Proofs for Integer Transition Systems
Marc Brockschmidt, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada
https://doi.org/10.1007/978-3-319-63046-5_28
Book:  Lecture Notes in Computer Science (Automated Deduction – CADE 26) Volume 10395 (2017), p. 454
A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
Sahel Alouneh, Sa’ed Abed, Mohammad H. Al Shayeji, Raed Mesleh
https://doi.org/10.1007/s10462-018-9628-0
Journal:  Artificial Intelligence Review Volume 52, Issue 4 (2019), p. 2575
Extracting a DPLL Algorithm
Andrew Lawrence, Ulrich Berger, Monika Seisenberger
https://doi.org/10.1016/j.entcs.2012.08.016
Journal:  Electronic Notes in Theoretical Computer Science Volume 286 (2012), p. 243
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
Filip Marić
https://doi.org/10.1016/j.tcs.2010.09.014
Journal:  Theoretical Computer Science Volume 411, Issue 50 (2010), p. 4333
Formalization of Abstract State Transition Systems for SAT
Filip Maric, Predrag Janicic
https://doi.org/10.2168/LMCS-7(3:19)2011
Journal:  Logical Methods in Computer Science Volume Volume 7, Issue 3 (2011)


Share


RSS