Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
The pathwidth and treewidth of cographs
SIAM Journal on Discrete Mathematics
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
On the hardness of approximate reasoning
Artificial Intelligence
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Reduction algorithms for graphs of small treewidth
Information and Computation
Recognizability Equals Definability for Partial k-Paths
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Linear algorithms on k-terminal graphs
Linear algorithms on k-terminal graphs
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Bayesian Networks and Decision Graphs
Bayesian Networks and Decision Graphs
Treewidth computations I. Upper bounds
Information and Computation
Logspace Versions of the Theorems of Bodlaender and Courcelle
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Treewidth computations II. Lower bounds
Information and Computation
Fly-automata, their properties and applications
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
| Hi-index | 0.00 |
This paper combines two classic results from two different fields: the result by Lauritzen and Spiegelhalter [21] that the probabilistic inference problem on probabilistic networks can be solved in linear time on networks with a moralization of bounded treewidth, and the result by Courcelle [10] that problems that can be formulated in counting monadic second order logic can be solved in linear time on graphs of bounded treewidth. It is shown that, given a probabilistic network whose moralization has bounded treewidth and a property P of the network and the values of the variables that can be formulated in counting monadic second order logic, one can determine in linear time the probability that P holds.