Tree clustering for constraint networks
- 1 April 1989
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 38 (3) , 353-366
- https://doi.org/10.1016/0004-3702(89)90037-4
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Arc and path consistency revisitedArtificial Intelligence, 1986
- An assumption-based TMSArtificial Intelligence, 1986
- The complexity of some polynomial network consistency algorithms for constraint satisfaction problemsArtificial Intelligence, 1985
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation LaboratoryACM Transactions on Programming Languages and Systems, 1981
- A truth maintenance systemArtificial Intelligence, 1979
- Synthesizing constraint expressionsCommunications of the ACM, 1978