Abstract
"Determinization" of resolution is usually done by a DPLL-like procedure that operates on partial assignments. We introduce a resolution-based SAT-solver operating on complete assignments and give a theoretical justification for deterrninizing resolution this way. This justification is based on the notion of a point image of resolution proof. We give experimental results confirming the viability of our approach. The complete version of this paper is given in [2]. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Goldberg, E. (2006). Determinization of resolution by an algorithm operating on complete assignments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4121 LNCS, pp. 90–95). Springer Verlag. https://doi.org/10.1007/11814948_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
