On the Integration of Singleton Consistencies and Look-Ahead Heuristics

Authors:
Marco Correia;Pedro Barahona
Affiliations:
Centro de Inteligência Artificial, Departamento de Informática, Universidade Nova de Lisboa, Caparica, Portugal 2829-516;Centro de Inteligência Artificial, Departamento de Informática, Universidade Nova de Lisboa, Caparica, Portugal 2829-516
Venue:
Recent Advances in Constraints
Year:
2008

Citing 9
Cited 0

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Dual viewpoint heuristics for binary constraint satisfaction problems

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Random Constraint Satisfaction: Flaws and Structure

Constraints
Singleton Consistencies

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Balance and filtering in structured satisfiable problems

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 greedy approach to establish singleton arc consistency

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The constrainedness of search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficiency of complete solvers depends both on constraint propagation to narrow the domains and some form of complete search. Whereas constraint propagators should achieve a good trade-off between their complexity and the pruning that is obtained, search heuristics take decisions based on information about the state of the problem being solved. In general, these two components are independent and are indeed considered separately. A recent family of algorithms have been proposed to achieve a strong form of consistency called Singleton Consistency (SC). These algorithms perform a limited amount of search and propagation (lookahead) to remove inconsistent values from the variables domains, making SC costly to maintain. This paper follows from the observation that search states being explored while enforcing SC are an important source of information about the future search space which is being ignored. In this paper we discuss the integration of this look-ahead information into variable and value selection heuristics, and show that significant speedups are obtained in a number of standard benchmark problems.