The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting (2004)
Cached
Download Links
- [www.ics.uci.edu]
- [www.paradise.caltech.edu]
- [www.ics.uci.edu]
- [www.ics.uci.edu]
- [www.ics.uci.edu]
- DBLP
Other Repositories/Bibliography
by
Rina Dechter
,
Robert Mateescu
| Venue: | IN CP’04 |
| Citations: | 18 - 6 self |
BibTeX
@INPROCEEDINGS{Dechter04theimpact,
author = {Rina Dechter and Robert Mateescu},
title = {The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting},
booktitle = {IN CP’04},
year = {2004},
pages = {731--736},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR search space displays independencies present in the graphical model explicitly and may sometimes reduce the search space exponentially. Empirical
Citations
| 432 | Constraint Processing - Dechter |
| 250 | Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition - Dechter - 1990 |
| 109 | Recursive conditioning - Darwiche - 2001 |
| 73 | A complexity analysis of space-bound learning algorithms for the constraint satisfaction problem - Bayardo, Miranker - 1996 |
| 67 | Taking advantage of stable sets of variables in constraint satisfaction problems - Freuder, Quinn - 1985 |
| 41 | Approximating treewidth, pathwidth and minimum elimination tree-height - Bodlaender, Gilbert - 1991 |
| 37 | Value elimination: Bayesian inference via backtracking search - Bacchus, Dalmo, et al. - 2003 |
| 36 | Hybrid backtracking bounded by tree-decomposition of constraint networks - Jégou, Terrioux - 2003 |
| 9 | The use of lineal spanning trees to represent constraint satisfaction problems - Freuder, Quinn - 1987 |
