Exploiting Global Properties in Path-Consistency Applied on SAT

Abstract

The task of enforcing certain level of consistency in Boolean satisfiability problem (SAT problem) is addressed in this paper. The concept of path-consistency known from the constraint programming paradigm is revisited in this context.

Keywords

• SAT
• global consistency