Tree Clustering for Constraint Networks

@article{Dechter1989TreeCF,
  title={Tree Clustering for Constraint Networks},
  author={R. Dechter and J. Pearl},
  journal={Artif. Intell.},
  year={1989},
  volume={38},
  pages={353-366}
}
  • R. Dechter, J. Pearl
  • Published 1989
  • Mathematics, Computer Science
  • Artif. Intell.
  • Abstract The paper offers a systematic way of regrouping constraints into hierarchical structures capable of supporting search without backtracking. The method involves the formation and preprocessing of an acyclic database that permits a large variety of queries and local perturbations to be processed swiftly, either by sequential backtrack-free procedures, or by distributed constraint propagation processes. 
    617 Citations

    Topics from this paper

    Tree-Clustering Schemes for Constraint-Processing
    • 79
    Hybrid backtracking bounded by tree-decomposition of constraint networks
    • 166
    • Highly Influenced
    • PDF
    A Revised Sufficient Condition for Backtrack-Free Search
    • 6
    Backtrack-Free Search for Resource Allocation
    • 5
    Hypertree Decompositions: Structure, Algorithms, and Applications
    • 85
    • Highly Influenced
    • PDF
    On the Practical Significance of Hypertree vs. TreeWidth
    • 4
    • PDF
    Bounding Search Space Size via (Hyper)tree Decompositions
    • 5
    • PDF

    References

    SHOWING 1-10 OF 19 REFERENCES
    Synthesizing constraint expressions
    • 653
    • PDF
    A Sufficient Condition for Backtrack-Free Search
    • 811
    • PDF
    Belief Maintenance in Dynamic Constraint Networks
    • 311
    Removing Redundancies in Constraint Networks
    • 41
    An Assumption-Based TMS
    • J. D. Kleer
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1986
    • 1,857
    • PDF
    Complexity of finding embeddings in a k -tree
    • 1,280
    A New Method for Solving Constraint Satisfaction Problems
    • R. Seidel
    • Mathematics, Computer Science
    • IJCAI
    • 1981
    • 88
    • PDF
    On the Desirability of Acyclic Database Schemes
    • 764
    • PDF