Determinization of Resolution by an Algorithm Operating on Complete Assignments

  • Eugene Goldberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4121)


“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 determinizing 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].


Point Image Algorithm Operating Proof System Satisfying Assignment Partial Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Davis, M., Longemann, G., Loveland, D.: A Machine program for theorem proving. Communications of the ACM 5, 394–397 (1962)MATHCrossRefGoogle Scholar
  2. 2.
    Goldberg, E.: Determinization of resolution by an algorithm operating on complete assignments. Technical report, CDNL-TR-2006-0110 (January 2006), available at

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Eugene Goldberg
    • 1
  1. 1.Cadence Berkeley LabsUSA

Personalised recommendations