Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Directed Arc Consistency Preprocessing
Constraint Processing, Selected Papers
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Russian doll search for solving constraint optimization problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Enhancements of branch and bound methods for the maximal constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Generalized Arc Consistency with Application to MaxCSP
AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Arc Consistency for Soft Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Range-Based Algorithm for Max-CSP
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Arc consistency for soft constraints
Artificial Intelligence
The Localization and Correction of Errors in Models: A Constraint-Based Approach
Applied Intelligence
Algebraic Structures for Bipolar Constraint-Based Reasoning
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Enhancing constraints manipulation in semiring-based formalisms
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Exploiting a common property resource under a fairness constraint: a case study
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Computational protein design as a cost function network optimization problem
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Following the work of R. Wallace on Max-CSP, later improved by J. Larrosa and P. Meseguer, we tested a number of possible improvements of the usage of directed arc consistency for the partial forward checking algorithm (PFC). The main improvement consists in exploiting a non standard. form of DAC called reversible DAC where each constraint is exploited in a direction which is not necessarily determined by the variable ordering and can change dynamically during the search. Other improvements include: (i) avoiding some constraint checks when forward-checking by exploiting the constraint checks perfonned during DAC preprocessing (ii) using a dynamic variable ordering during the search, (iii) maintaining the directed arc-consistency counts during the search as values get deleted. These improvements have been assessed empirically on random CSP instances. Some of them lead to very large performance gains with respect to the initial algorithm.