@article{Arnold2007,
author = {Arnold, Holger},
title = {A linearized DPLL calculus with learning},
url = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-15421},
year = {2007},
abstract = {This paper describes the proof calculus LD for clausal propositional logic, which is a linearized form of the well-known DPLL calculus extended by clause learning. It is motivated by the demand to model how current SAT solvers built on clause learning are working, while abstracting from decision heuristics and implementation details. The calculus is proved sound and terminating. Further, it is shown that both the original DPLL calculus and the conflict-directed backtracking calculus with clause learning, as it is implemented in many current SAT solvers, are complete and proof-confluent instances of the LD calculus.},
language = {en}
}