Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
In search of the best constraint satisfaction search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Argumentation as distributed constraint satisfaction: applications and results
Proceedings of the fifth international conference on Autonomous agents
Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
Artificial Intelligence Review
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Maintenance scheduling problems as benchmarks for constraint algorithms
Annals of Mathematics and Artificial Intelligence
An Examination of Probabilistic Value-Ordering Heuristics
AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
AbsCon: A Prototype to Solve CSPs with Abstraction
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The Adaptive Constraint Engine
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Modelling and Solving Employee Timetabling Problems
Annals of Mathematics and Artificial Intelligence
CLSS: An Intelligent Crane Lorry Scheduling System
Applied Intelligence
Hard, flexible and dynamic constraint satisfaction
The Knowledge Engineering Review
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
International Journal of Computational Science and Engineering
A domain decomposition algorithm for constraint satisfaction
Journal of Experimental Algorithmics (JEA)
Value ordering for quantified CSPs
Constraints
Combining local search and look-ahead for scheduling and constraint satisfaction problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Domain filtering consistencies
Journal of Artificial Intelligence Research
Value ordering for finding all solutions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
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
Value ordering for finding all solutions: interactions with adaptive variable ordering
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Predicting optimal constraint satisfaction methods
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Pruning by equally constrained variables
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
A value ordering heuristic for local search in distributed resource allocation
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Hi-index | 0.00 |
Looking ahead during search is often useful when solving constraint satisfaction problems. Previous studies have shown that looking ahead helps by causing dead-ends to occur earlier in the search, and by providing information that is useful for dynamic variable ordering. In this paper, we show that another benefit of looking ahead is a useful domain value ordering heuristic, which we call look-ahead value ordering or LVO. LVO counts the number of times each value of the current variable conflicts with some value of a future variable, and the value with the lowest number of conflicts is chosen first. Our experiments show that look-ahead value ordering can be of substantial benefit, especially on hard constraint satisfaction problems.