Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Principles of artificial intelligence
Principles of artificial intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Tree clustering for constraint networks (research note)
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Journal of Combinatorial Theory Series B
Valuation-based systems for Bayesian decision analysis
Operations Research
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
The disjunctive decomposition of logic functions
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Symbolic Model Checking
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Hierarchical Representations of Discrete Functions, with Application to Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A differential approach to inference in Bayesian networks
Journal of the ACM (JACM)
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Constraint Processing
Algorithms and heuristics for constraint satisfaction problems
Algorithms and heuristics for constraint satisfaction problems
Algorithms and Complexity Results for #SAT and Bayesian Inference
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Case-factor diagrams for structured probabilistic modeling
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Journal of Artificial Intelligence Research
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
AND/OR branch-and-bound for graphical models
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Decision diagrams for the computation of semiring valuations
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
New advances in inference by recursive conditioning
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Value elimination: bayesian inference via backtracking search
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
On probabilistic inference by weighted model counting
Artificial Intelligence
Best-First AND/OR Search for 0/1 Integer Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
AND/OR Multi-valued Decision Diagrams for Constraint Networks
Concurrency, Graphs and Models
Approximate Solution Sampling (and Counting) on AND/OR Spaces
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Troubleshooting when Action Costs are Dependent with Application to a Truck Engine
Proceedings of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008
Mixed deterministic and probabilistic networks
Annals of Mathematics and Artificial Intelligence
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Memory intensive AND/OR search for combinatorial optimization in graphical models
Artificial Intelligence
Best-first AND/OR search for graphical models
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
M-DPOP: faithful distributed implementation of efficient social choice problems
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams for constraint optimization
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Exploiting problem structure for solution counting
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Exploiting problem decomposition in multi-objective constraint optimization
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
SampleSearch: Importance sampling in presence of determinism
Artificial Intelligence
Journal of Automated Reasoning
International Journal of Computer Vision
Efficient approximation algorithms for multi-objective constraint optimization
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Importance sampling-based estimation over AND/OR search spaces for graphical models
Artificial Intelligence
Drake: an efficient executive for temporal plans with choice
Journal of Artificial Intelligence Research
Lifted probabilistic inference by first-order knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Anytime AND/OR depth-first search for combinatorial optimization
AI Communications - The Symposium on Combinatorial Search
Bucket and mini-bucket schemes for m best solutions over graphical models
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
Concurrent forward bounding for distributed constraint optimization problems
Artificial Intelligence
Algorithms for generating ordered solutions for explicit AND/OR structures: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
The paper introduces an AND/OR search space perspective for graphical models that include probabilistic networks (directed or undirected) and constraint networks. 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. Indeed, most algorithmic advances in search-based constraint processing and probabilistic inference can be viewed as searching an AND/OR search tree or graph. Familiar parameters such as the depth of a spanning tree, treewidth and pathwidth are shown to play a key role in characterizing the effect of AND/OR search graphs vs. the traditional OR search graphs. We compare memory intensive AND/OR graph search with inference methods, and place various existing algorithms within the AND/OR search space.