Characterizing SAT Problems with the Row Convexity Property

Authors:
Hachemi Bennaceur;Chu Min Li
Affiliations:
-;-
Venue:
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Year:
2002

Citing 3
Cited 1

On the minimality and global consistency of row-convex constraint networks

Journal of the ACM (JACM)
A constraint-based approach to narrow search trees for satisfiability

Information Processing Letters
SAT v CSP

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming

Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.