Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in 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
Decomposing a relation into a tree of binary relations
Journal of Computer and System Sciences
Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals
Artificial Intelligence
Graphical models for machine learning and digital communication
Graphical models for machine learning and digital communication
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Topological parameters for time-space tradeoff
Artificial Intelligence
A comparison of structural CSP decomposition methods
Artificial Intelligence
A general scheme for automatic generation of search heuristics from specification dependencies
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Local computation with valuations from a commutative semigroup
Annals of Mathematics and Artificial Intelligence
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Axioms for probability and belief-function proagation
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Constraint Processing
Theory of Relational Databases
Theory of Relational Databases
A comparison of structural CSP decomposition methods
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Iterative join-graph propagation
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
An evaluation of structural parameters for probabilistic reasoning: results on benchmark circuits
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Ship structure knowledge-based military specification virtual test system's design
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Improving DPOP with function filtering
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Efficient multi-agent coordination using resource-aware junction trees
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
Efficient graph reachability query answering using tree decomposition
RP'10 Proceedings of the 4th international conference on Reachability problems
Towards parallel non serial dynamic programming for solving hard weighted CSP
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
SampleSearch: Importance sampling in presence of determinism
Artificial Intelligence
Resource-aware junction trees for efficient multi-agent coordination
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Adaptive Exact Inference in Graphical Models
The Journal of Machine Learning Research
Characterizing propagation methods for boolean satisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Anytime AND/OR depth-first search for combinatorial optimization
AI Communications - The Symposium on Combinatorial Search
Distributed tree decomposition with privacy
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Semiring-based mini-bucket partitioning schemes
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
The inclusion-exclusion rule and its application to the junction tree algorithm
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. Within this framework, we introduce a new algorithm, called bucket-tree elimination (BTE), that extends Bucket Elimination (BE) to trees, and show that it can provide a speed-up of n over BE for various reasoning tasks. Time-space tradeoffs of tree-decomposition processing are analyzed.