Automatically configuring constraint satisfaction programs: A case study
- 1 September 1996
- journal article
- Published by Springer Nature in Constraints
- Vol. 1 (1-2) , 7-43
- https://doi.org/10.1007/bf00143877
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Learning to improve constraint-based schedulingArtificial Intelligence, 1992
- A generic arc-consistency algorithm and its specializationsArtificial Intelligence, 1992
- Quantitative results concerning the utility of explanation-based learningArtificial Intelligence, 1990
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988
- Efficient algorithms for finding maximum matching in graphsACM Computing Surveys, 1986
- Search rearrangement backtracking and polynomial average timeArtificial Intelligence, 1983
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- A language and a program for stating and solving combinatorial problemsArtificial Intelligence, 1978
- Backtrack programming techniquesCommunications of the ACM, 1975