Exploiting the deep structure of constraint problems
- 31 October 1994
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 70 (1-2), 73-117
- https://doi.org/10.1016/0004-3702(94)90104-x
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- Partial constraint satisfactionArtificial Intelligence, 1992
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- A cluster detection algorithm based on percolation theoryPattern Recognition Letters, 1991
- Phase transitions in artificial intelligence systemsArtificial Intelligence, 1987
- An assumption-based TMSArtificial Intelligence, 1986
- Optimization by Simulated AnnealingScience, 1983
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemDiscrete Applied Mathematics, 1983
- Generalization as searchArtificial Intelligence, 1982
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953