Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Constraint relaxation may be perfect
Artificial Intelligence
From local to global consistency
Artificial Intelligence
Characterising tractable constraints
Artificial Intelligence
The essence of constraint propagation
Theoretical Computer Science
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Synthesizing constraint expressions
Communications of the ACM
Radio Link Frequency Assignment
Constraints
On forward checking for non-binary constraint satisfaction
Artificial Intelligence
Contradicting Conventional Wisdom in Constraint Satisfaction
PPCP '94 Proceedings of the Second International Workshop 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
Improving domain filtering using restricted path consistency
CAIA '95 Proceedings of the 11th Conference on Artificial Intelligence for Applications
A Strong Local Consistency for Constraint Satisfaction
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Constraint Processing
Backjump-Based Techniques versus Conflict-Directed Heuristics
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Principles of Constraint Programming
Principles of Constraint Programming
Theoretical analysis of singleton arc consistency and its extensions
Artificial Intelligence
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
Optimization of Simple Tabular Reduction for Table Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Inverse Consistencies for Non-binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Domain filtering consistencies
Journal of Artificial Intelligence Research
Set intersection and consistency in constraint networks
Journal of Artificial Intelligence Research
Using pivot consistency to decompose and solve functional CSPS
Journal of Artificial Intelligence Research
Path consistency on triangulated constraint graphs
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A study of residual supports in arc consistency
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A greedy approach to establish singleton arc consistency
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Lightweight Detection of Variable Symmetries for Constraint Satisfaction
ICTAI '09 Proceedings of the 2009 21st IEEE International Conference on Tools with Artificial Intelligence
Path consistency by dual consistency
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint Networks: Techniques and Algorithms
Constraint Networks: Techniques and Algorithms
On the minimality and decomposability of constraint networks
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
A framework for decision-based consistencies
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Revisiting neighborhood inverse consistency on binary CSPs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build a full picture of the relationships existing between four basic second-order consistencies, namely path consistency (PC), 3-consistency (3C), dual consistency (DC) and 2-singleton arc consistency (2SAC), as well as their conservative and strong variants. Interestingly, dual consistency is an original property that can be established by using the outcome of the enforcement of generalized arc consistency (GAC), which makes it rather easy to obtain since constraint solvers typically maintain GAC during search. On binary constraint networks, DC is equivalent to PC, but its restriction to existing constraints, called conservative dual consistency (CDC), is strictly stronger than traditional conservative consistencies derived from path consistency, namely partial path consistency (PPC) and conservative path consistency (CPC). After introducing a general algorithm to enforce strong (C)DC, we present the results of an experimentation over a wide range of benchmarks that demonstrate the interest of (conservative) dual consistency. In particular, we show that enforcing (C)DC before search clearly improves the performance of MAC (the algorithm that maintains GAC during search) on several binary and non-binary structured problems.