(Enter summary)
Abstract: The contribution of this paper is in vieweing search for constraint
processing in the context of AND/OR search spaces and in demonstrating the
impact of this view on solutions counting. In a companion paper we introduce
the AND/OR search space idea for probabilistic reasoning. In contrast to the traditional
(OR) search space view, the AND/OR search tree displays some of the
independencies present in the graphical model explicitly and may sometimes reduce
the search space exponentially.... (Update)
Cited by: More
The Impact of AND/OR Search Spaces on Constraint - Satisfaction And Counting
(Correct)
Active bibliography (related documents): More All
1.2: AND/OR Search Spaces for Graphical Models - Rina Dechter Department (2004)
(Correct)
0.5: Mixtures of Deterministic-Probabilistic Networks and their.. - Dechter, Mateescu
(Correct)
0.4: Backtracking Algorithms for Constraint Satisfaction Problems.. - Dechter, Frost (1998)
(Correct)
Similar documents based on text: More All
0.2: A Simple Insight into Iterative Belief Propagation's Success - Rina Dechter And (2003)
(Correct)
0.2: Iterative Algorithms for Graphical Models - Mateescu (2003)
(Correct)
0.2: Iterative Join-Graph Propagation - Dechter, Kask, Mateescu (2002)
(Correct)
BibTeX entry: (Update)
Dechter, R., Mateescu, R.: The impact of AND/OR search spaces on constraint satisfaction and counting. Technical report, UCI (2004) http://citeseer.ist.psu.edu/713082.html More
@misc{ dechter04impact,
author = "Rina Dechter and Robert Mateescu",
title = "The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting",
text = "Dechter, R., Mateescu, R.: The impact of AND/OR search spaces on constraint
satisfaction and counting. Technical report, UCI (2004)",
year = "2004",
url = "citeseer.ist.psu.edu/713082.html" }
Citations (may not include all citations):
760
Probabilistic Reasoning in Intelligent Systems (context) - Pearl - 1988
297
Symbolic Model Checking (context) - McMillan - 1993
267
Network-based heuristics for constraint satisfaction problem.. (context) - Dechter, Pearl - 1987
211
Enhancement schemes for constraint processing: Backjumping (context) - Dechter - 1990
130
Influence diagrams (context) - Howard, Matheson - 1984
109
Efficient algorithms for combinatorial problems on graphs wi.. (context) - Arnborg - 1985
28
Constraint Processing (context) - Dechter - 2003
11
Hierarchical representation of discrete functions with appli.. (context) - McMillan - 1994
11
Performance measurement and analysis of search algorithms (context) - Gaschnig - 1979
10
Algorithms and heuristics for constraint satisfaction proble.. (context) - Frost - 1997
8
A complexity analysis of space-bound learning algorithms for.. (context) - Bayardo, Miranker - 1996
8
pathwidth and minimum elimination tree-height (context) - Bodlaender, Gilbert - 1991
8
The use of lineal spanning trees to represent constraint sat.. (context) - Freuder, Quinn - 1987
7
Recursive conditioning (context) - Darwiche - 1999
4
ANDOR search space graphical model
- OR, for et al. - 2004
4
Value elimination: Bayesian inference via backtracking searc..
- Bacchus, Piassi - 2003
3
Hybrid backtracking bounded by tree-decomposition of constra.. (context) - Terrioux, Jegou - 2003
Documents on the same site (http://www.ics.uci.edu/~dechter/publications/): More
Up and Down Mini-Buckets: A Scheme for Approximating.. - Kask, Larrosa, Dechter (2001)
(Correct)
Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998)
(Correct)
On the Time Complexity of Bucket Elimination Algorithms - Larrosa (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC