Network-based heuristics for constraint-satisfaction problems
- 31 December 1987
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 34 (1), 1-38
- https://doi.org/10.1016/0004-3702(87)90002-6
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- 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
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- A method for computing heuristics in problem solvingInformation Sciences, 1979
- A truth maintenance systemArtificial Intelligence, 1979
- Consistency in networks of relationsArtificial Intelligence, 1977
- Estimating the Efficiency of Backtrack ProgramsMathematics of Computation, 1975