On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
On forward checking for non-binary constraint satisfaction
Artificial Intelligence
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
CSPLIB: A Benchmark Library for Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
On the validity and complexity of bounded resolution
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Data structures for generalised arc consistency for extensional constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Exact phase transitions in random constraint satisfaction problems
Journal of Artificial Intelligence Research
A comparison of ATMS and CSP techniques
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A compression algorithm for large arity extensional constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A generalized framework for conflict analysis
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Generalized arc consistency for positive table constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
We investigate in this work a generalization of the known CNF representation that we call General Normal Form (GNF) and extend the resolution rule of Robinson to design a new sound and complete resolution proof system for the GNF. We show that by using a cardinality operator in the GNF we obtain the new representation CGNF that allows a natural and efficient Boolean encoding for n-ary finite discrete extensional CSPs. We prove that the space complexity of a CSP encoded in the CGNF is identical to its space complexity when it is expressed in the classical CSP representation. We prove that the generalized resolution rule applies for the CGNF encoding and introduce a new inference rule whose application until saturation achieves arc-consistency in a linear time complexity for n-ary CSP expressed in the CGNF encoding. Two enumerative methods for solving CSP instances encoded in this Boolean framework are studied: the first one (equivalent to MAC in CSPs) maintains full arc-consistency at each node of the search tree while the second (equivalent to FC in CSPs) performs partial arc-consistency on each node. Both methods are experimented and compared on some instances of the Ramsey problem, randomly generated 3/4-ary CSPs and promising results are obtained. We also adapted the notion of clause learning defined in SAT for the CGNF encoding. Finally, we show how the proposed inference rule can be used to achieve Path-consistency in the case of binary CSPs encoded in CGNF, and how it can be used to enforce strong path consistency when it is combined with the generalized resolution rule.