The complexity of constraint satisfaction revisited
- 1 February 1993
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 59 (1-2) , 57-62
- https://doi.org/10.1016/0004-3702(93)90170-g
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On the parallel complexity of discrete relaxation in constraint satisfaction networksArtificial Intelligence, 1990
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Arc and path consistency revisitedArtificial Intelligence, 1986
- The complexity of some polynomial network consistency algorithms for constraint satisfaction problemsArtificial Intelligence, 1985
- Hierarchical arc consistency: exploiting structured domains in constraint satisfaction problemsComputational Intelligence, 1985
- Consistency in networks of relationsArtificial Intelligence, 1977
- On seeing thingsArtificial Intelligence, 1971
- REF-ARF: A system for solving problems stated as proceduresArtificial Intelligence, 1970