Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Search lessons learned from crossword puzzles
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Reasoning about qualitative temporal information
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Combining qualitative and quantitative constraints in temporal reasoning
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Is there any need for domain-dependent control information?
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Solving constraint satisfaction problems using finite state automata
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Conjunctive width heuristics for maximal constraint satisfaction
AAAI'93 Proceedings of the eleventh national 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
Improving the distributed constraint optimization using social network analysis
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
Heuristic techniques for variable and value ordering in CSPs
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Predicting optimal constraint satisfaction methods
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Modeling and solving technical product configuration problems
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Hi-index | 0.00 |
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of pre-processing techniques designed to make the representation of the CSP more explicit, including directional-arc-consistency, directional-path-consistency and adaptive-consistency. The second scheme aims at improving the order in which variables are chosen for evaluation during the search. In the first part of the experiment we tested the performance of backtracking (and its common enhancement - backjumping) with and without each of the preprocessings techniques above. The results show that directional arc-consistency, a scheme which embodies the simplest form of constraint recording, outperforms all other preprocessing techniques. The results of the second part of the experiment suggest that the best variable ordering is achieved by the fixed max-cardinality search order.