Bucket Elimination: A Unifying Framework for Processing Hard and Soft Constraints

Constraints

Volumn 2, Issue 1, 1997, Pages 51-55

  Dechter, Rina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Graphs; Search; Variable elimination

Indexed keywords

EID: 2342464194     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009796922698     Document Type: Article

References (9)

1. R. Dechter. (1990). Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence 41: 273-312.
2. R. Dechter. (1992). Constraint networks. Encyclopedia of Artificial Intelligence, pp. 276-285.
3. R. Dechter. (1996). Bucket elimination: a unifying framework for several probabilistic inference algorithms. In Uncertainty in AI (UAI96), pp. 211-219.
4. R. Dechter & I. Rish. (1994). Directional resolution: The davis-putnam procedure, revisited. In Proceedings of Knowledge Representation (KR-94), pp. 134-145, Bonn, Germany.
5. R. Dechter & P. van Beek. (1995). Local and global relational consistency. In First International Conference on Principles and Practice of Constraint programming (CP 95), pp. 240-257, Cassis, France.
6. E. C. Freuder. (1982). A sufficient condition for backtrack-free search. Journal of the ACM 29: 24-32.
7. A. Mackworth. (1992). Constraint satisfaction. Encyclopedia of Artificial Intelligence, pp. 285-293.
8. U. Montanari. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7: 95-132.
9. J. Pearl. (1988). Probabilistic reasoning in intelligent systems. In Morgan Kaufmann Publishers. Constraints: An International Journal, 2, 63-69 (1997)