Abstract. The literal encoding of the satisfiability problem (SAT)as a binary constraint satisfaction problem (CSP) allows us to make a technical comparison between the propositional logic and the con-straint network fields. Equivalencies or analogies between concepts and techniques used in the two fields are then shown. For instance itis shown that arc consistency is equivalent to unit resolution [7, 2]. This result is generalized here by relating the local consistency con-cepts with inference rules in the propositional logic. We relate the pure literal rule with an interesting property of constraint networkscalled &quot;row convexity&quot;, and we propose an empirical characterization of satisfiable and unsatisfiable 3-SAT instances. 1 Introduction This work is based on the literal encoding of the satisfiability prob-lem (SAT) as a binary constraint satisfaction problem (CSP) . Th
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.