Using recursive decomposition to construct elimination orders, jointrees, and dtrees

DOI10.1007/3-540-44652-4_17MaRDI QIDQ4784837zbMATH OpenFDO

Authors Adnan Darwiche, Mark A. Hopkins

Publication date 12 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2143/21430180

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Methods for constructing balanced elimination trees and other recursive decompositions
• On constructing the elimination tree
• scientific article; zbMATH DE number 4053039
• Elimination trees and the construction of pools and stacks
• Computing Tree Decompositions
• Directed tree decompositions
• Practical access to dynamic programming on tree decompositions
• Practical access to dynamic programming on tree decompositions
• Tree decompositions for a class of graphs
• scientific article; zbMATH DE number 4168727

Cited in

(7)

• On constructing the elimination tree
• Unifying tree decompositions for reasoning in graphical models
• The role of graph structures in the theory of local elimination algorithms
• SampleSearch: importance sampling in presence of determinism
• Decision making with multiple objectives using GAI networks
• Methods for constructing balanced elimination trees and other recursive decompositions
• A new default theories compilation for MSP-entailment

This page was built for publication: Using recursive decomposition to construct elimination orders, jointrees, and dtrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4784837)