Advertisement
Published in:
2002 | OriginalPaper | Chapter
Characterizing SAT Problems with the Row Convexity Property
Authors : Hachemi Bennaceur, Chu Min Li
Published in: Principles and Practice of Constraint Programming - CP 2002
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Using the literal encoding of the satisfiability problem (SAT) as a binary constraint satisfaction problem (CSP), we relate the path consistency concept and the row convexity of CSPs with the inference rules in the propositional logic field. Then, we use this result to propose a measure characterizing satisfiable and unsatisfiable 3-SAT instances. The correlation between the computational results allows us to validate this measure.