Hybrid Probabilistic/Deterministic Processing



 

[R119] Abstract | PDF
Radu Marinescu and Rina Dechter. "AND/OR Tree Search for Constraint Optimization". In the 6th International Workshop on Preferences and Soft Constraints, of the Tenth International Conference on Principles and Practice of Constraint Programming , CP'2004.

[R117] Abstract | PDF
Rina Dechter and Robert Mateescu. "The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting". In Constraint Programming, CP'2004.
[R117a] Abstract | PDF
Rina Dechter and Robert Mateescu. "The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting". ICS Technical Report, May 2004. Extended version.

[R115] Abstract | PDF
Rina Dechter. "AND/OR Search Spaces for Graphical Models". ICS Technical Report, March, 2004.

[R114] Abstract | PDF
Rina Dechter and Robert Mateescu. "Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space". In UAI 2004.

David Allen and Adnan Darwiche. New Advances in Inference by Recursive Conditioning. In Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI-2003)[pdf].

PDF
F. Bacchus, S. Dalmao, and T. Pitassi Value Elimination: Bayesian Inference via Backtracking Search Uncertainty in Artificial Intelligence (UAI-2003) 20-28, 2003.

PDF
F. Bacchus, S. Dalmao, and T. Pitassi Algorithms and Complexity Results for #Sat and Bayesian Inference, FOCS 2003 340-351, 2003.

[R100] Abstract | PostScript | PDF
David Larkin and Rina Dechter. "Bayesian Inference in the Presence of Determinism", In AI and Statistics, AI-STAT, 2003.

[R96] Abstract | PostScript | PDF
R. Dechter, D. Larkin, "Hybrid Processing of Beliefs and Constraints", In proceedings of UAI '01.   
[R96a] PostScript | PDF
Extended version, ICS Technical Report, June, 2001.

Darwiche, A. Recursive conditioning. Artificial Intelligence 126 (February 2001), Volume 126, p 5-41. pdf

[R93] Abstract | PostScript | PDF
J. Larrosa, "On the Time Complexity of Bucket Elimination Algorithms", An ICS technical report, January, 2001.

[R64] Abstract | PostScript | PDF
Dechter, R., "Bucket Elimination: A Unifying Framework For Processing Hard And Soft Constraints" In "Constraints: An International Journal", No. 2, pp. 51-55, 1997.

[R48] Abstract | PostScript | PDF
R. Dechter, "Bucket Elimination: A Unifying Framework for Probabilistic Inference" In "Uncertainty in Artificial Intelligence", UA196, 1996, pp. 211-219.    [R48a] Abstract | PostScript | PDF, An extended version. In the volume in "Learning and Inference in Graphical Models."   [R48b] PostScript | PDF
"Bucket Elimination: A unifying framework for Reasoning." In "Artificial Intelligence", October, 1999

PDF
Bonet,M.; Esteban, J.L.; Galesi, N.; and Johannsen, J. 1998. Exponential separations between restricted resolution and cutting plans proof systems Proc. of 38th FOCS, 638-647.

  • R. J. Bayardo Jr. and D. P. Miranker. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In Proc. of the 13th National Conf. on Artificial Intelligence, 298-304, 1996.
    aaai96.pdf (Portable Document Format, 119k)

    [R8] Dechter, R., "Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition." Artificial Intelligence, Vol. 41(3), January 1990, pp.273-312.



    E-mail any questions/comments/corrections to: bartels@ssli.ee.washington.edu