Abstract
Following the work of Wallace, who introduced the use of directed arc-consistency in MAX-CSP algorithms using DAC counts, we present a number of improvements of DAC usage for the P-EFC3 algorithm. These improvements include: (i) a better detection of dead-ends, (ii) a more effective form for value pruning, and (iii) a different heuristic criterion for value ordering. Considering the new DAC usage, we have analyzed some static variable ordering heuristics previously suggested, and we propose new ones which have been shown effective. The benefits of our proposal has been assessed empirically solving random CSP instances, showing a clear performance gain with respect to previous approaches.
This research has been supported by the Spanish CICYT under the project #TAP93-0451.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Bakker R., Dikker F., Tempelman F. and Wognum P. (1993). Diagnosing and solving overdetermined constraint satisfaction problems Proceedings of IJCAI-93, 276–281.
Dechter R. and Pearl J. (1988). Network-based heuristics for constraint satisfaction problems, Artificial Intelligence, 34, 1–38.
Feldman R. and Golumbic M. C. (1990). Optimization algorithms for student scheduling via constraint satisfiability, Computer Journal, vol. 33, 356–364.
Fox M. (1987). Constraint-directed Search: A Case Study on Jop-Shop Scheduling. Morgan-Kauffman.
Freuder E. C. and Wallace R. J. (1992). Partial constraint satisfaction, Artificial Intelligence, 58:21–70.
Larrosa J. and Meseguer P. (1995). Optimization-based Heuristics for Maximal Constraint Satisfaction, Proceedings of CP-95, 103–120.
Larrosa J. and Meseguer P. (1996). Phase Transition in MAX-CSP, Proceedings of ECAI-96, 190–194.
Prosser P. (1994). Binary constraint satisfaction problems: some are harder than others, Proceedings of ECAI-94, 95–99.
Smith B. M. (1994). Phase thansition and the mushy region in constraint satisfaction problems, Proceedings of ECAI-94, 100–104.
Wallace R. J. and Freuder E. C. (1993). Conjunctive width heuristics for maximal constraint satisfaction, Proceedings of AAAI-93, 762–778.
Wallace R. J. (1994).Directed Arc Consistency Preprocessing as a Strategy for Maximal Constraint Satisfaction, ECAI94 Workshop on Constraint Processing, M. Meyer editor, 69–77.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larrosa, J., Meseguer, P. (1996). Exploiting the use of DAC in MAX-CSP. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_83
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive