ML Anthology

Tree-Clustering Schemes for Constraint-Processing

Rina Dechter, Judea Pearl
AAAI 1988 pp. 150-154
/aaai/1988/dechter1988aaai-tree/

Abstract

The paper offers a systematic way of regrouping constraints into hierarchical structures capable of supporting information retrieval 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.

PDF AAAI Semantic Scholar

Cite

Text

Dechter and Pearl. "Tree-Clustering Schemes for Constraint-Processing." AAAI Conference on Artificial Intelligence, 1988.

Markdown

[Dechter and Pearl. "Tree-Clustering Schemes for Constraint-Processing." AAAI Conference on Artificial Intelligence, 1988.](https://mlanthology.org/aaai/1988/dechter1988aaai-tree/)

BibTeX

@inproceedings{dechter1988aaai-tree,
  title     = {{Tree-Clustering Schemes for Constraint-Processing}},
  author    = {Dechter, Rina and Pearl, Judea},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1988},
  pages     = {150-154},
  url       = {https://mlanthology.org/aaai/1988/dechter1988aaai-tree/}
}