An Adaptation of Path Consistency for Boolean Satisfiability

Abstract

The concept of path-consistency known from the constraint programming paradigm (CP) is adapted for SAT. The adaptation consists in increasing inference strength of the consistency on the literal encoding model of SAT.

Keywords

• Path-Consistency
• Boolean Satisfiability