A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree search and ARC consistency in constraint satisfaction algorithms
Search in Artificial Intelligence
How to solve the Zebra problem, or path consistency the easy way
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
On the inherent level of local consistency in constraint networks
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
Using constraint metaknowledge to reduce arc consistency computation
Artificial Intelligence
Journal of the ACM (JACM)
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Radio Link Frequency Assignment
Constraints
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First 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
TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
Two New Constraint Propagation Algorithms Requiring Small Space Complexity
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
A Strong Local Consistency for Constraint Satisfaction
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Look-ahead value ordering for constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Neighborhood inverse consistency preprocessing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Binary vs. non-binary constraints
Artificial Intelligence
Using finite domains in constraint satisfaction problem
Intelligent information processing II
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
A Linear Programming Approach to Max-Sum Problem: A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Theoretical analysis of singleton arc consistency and its extensions
Artificial Intelligence
Domain filtering consistencies for non-binary constraints
Artificial Intelligence
Connecting ABT with Arc Consistency
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Aiding design with constraints: an extension of quad trees in order to deal with piecewise functions
International Journal of Computer Integrated Manufacturing - Industrial Engineering and Systems Management
Constraint-Level Advice for Shaving
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Multi-Objective Propagation in Constraint Programming
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
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
Beyond Singleton Arc Consistency
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Heuristics for Dynamically Adapting Propagation
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Transposition tables for constraint satisfaction
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results
Journal of Artificial Intelligence Research
Local consistency for extended CSPs
Theoretical Computer Science
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning from last conflict(s) in constraint programming
Artificial Intelligence
Path consistency by dual consistency
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Exploiting past and future: pruning by inconsistent partial state dominance
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Extracting microstructure in binary constraint networks
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Failed value consistencies for constraint satisfaction
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Improving the performance of maxRPC
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Complex university course timetabling
Journal of Scheduling
Integrating strong local consistencies into constraint solvers
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Journal of Artificial Intelligence Research
A framework for decision-based consistencies
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
MaxRPC algorithms based on bitwise operations
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Lookahead in smodels compared to local consistencies in CSP
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Extending generalized arc consistency
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
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 |
Enforcing local consistencies is one of the main features of constraint reasoning. Which level of local consistency should be used when searching for solutions in a constraint network is a basic question. Arc consistency and partial forms of arc consistency have been widely studied, and have been known for sometime through the forward checking or the MAC search algorithms. Until recently, stronger forms of local consistency remained limited to those that change the structure of the constraint graph, and thus, could not be used in practice, especially on large networks. This paper focuses on the local consistencies that are stronger than arc consistency, without changing the structure of the network, i.e., only removing inconsistent values from the domains. In the last five years, several such local consistencies have been proposed by us or by others. We make an overview of all of them, and highlight some relations between them. We compare them both theoretically and experimentally, considering their pruning efficiency and the time required to enforce them.