Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
- 31 January 1990
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 41 (3), 273-312
- https://doi.org/10.1016/0004-3702(90)90046-3
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- An assumption-based TMSArtificial Intelligence, 1986
- The complexity of some polynomial network consistency algorithms for constraint satisfaction problemsArtificial Intelligence, 1985
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- Solving combinatorial search problems by intelligent backtrackingInformation Processing Letters, 1981
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- A truth maintenance systemArtificial Intelligence, 1979
- Consistency in networks of relationsArtificial Intelligence, 1977
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1971