Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

IFIP International Conference on Theoretical Computer Science

TCS 2012: Theoretical Computer Science pp 43–56Cite as

  1. Home
  2. Theoretical Computer Science
  3. Conference paper
Probabilistic Inference and Monadic Second Order Logic

Probabilistic Inference and Monadic Second Order Logic

  • Marijke Hans L. Bodlaender18 
  • Conference paper
  • 797 Accesses

  • 1 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7604)

Abstract

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.

Keywords

  • Linear Time
  • Directed Acyclic Graph
  • Order Logic
  • Tree Decomposition
  • Parse Tree

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

An Erratum for this chapter can be found at http://dx.doi.org/10.1007/978-3-642-33475-7_27

Download conference paper PDF

References

  1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308–340 (1991)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305–1317 (1996)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1–45 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Information and Computation 208, 259–275 (2010)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations II. Lower bounds. Information and Computation 209, 1103–1119 (2011)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Bodlaender, H.L., Möhring, R.H.: The pathwidth and treewidth of cographs. SIAM Journal on Discrete Mathematics 6, 181–188 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Bodlaender, H.L., van Antwerpen-de Fluiter, B.: Reduction algorithms for graphs of small treewidth. Information and Computation 167, 86–119 (2001)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7, 555–581 (1992)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Borie, R.B., Parker, R.G., Tovey, C.A.: Solving problems on recursively constructed graphs. ACM Computing Surveys 41(4) (2008)

    Google Scholar 

  10. Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12–75 (1990)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Courcelle, B., Durand, I.A.: Fly-Automata, Their Properties and Applications. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 264–272. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  12. Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science 109, 49–82 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. Daskalakis, C., Papadimitriou, C.H.: Computing pure Nash equilibria in graphical games via Markov random fields. In: Feigenbaum, J., Chuang, J.C.-I., Pennock, D.M. (eds.) Proceedings 7th ACM Conference on Electronic Commerce EC-2006, pp. 91–99. ACM (2006)

    Google Scholar 

  14. Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of Bodlaender and Courcelle, pp. 143–152 (2010)

    Google Scholar 

  15. Fellows, M.R., Langston, M.A.: An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, FOCS 1989, pp. 520–525 (1989)

    Google Scholar 

  16. Jensen, F.V., Nielsen, T.D.: Bayesian Networks and Decision Graphs, 2nd edn. Information Science and Statistics. Springer (2007)

    Google Scholar 

  17. Kabanets, V.: Recognizability Equals Definability for Partial k-paths. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 805–815. Springer, Heidelberg (1997)

    CrossRef  Google Scholar 

  18. Kaller, D.: Definability equals recognizability of partial 3-trees and k-connected partial k-trees. Algorithmica 27, 348–381 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. Kloks, T.: Treewidth. Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  20. Koster, A.M.C.A., van Hoesel, S.P.M., Kolen, A.W.J.: Solving partial constraint satisfaction problems with tree decomposition. Networks 40(3), 170–180 (2002)

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. Lauritzen, S.J., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. The Journal of the Royal Statistical Society. Series B (Methodological) 50, 157–224 (1988)

    MathSciNet  MATH  Google Scholar 

  22. Pearl, J.: Probablistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Palo Alto (1988)

    Google Scholar 

  23. Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 309–322 (1986)

    CrossRef  MathSciNet  MATH  Google Scholar 

  24. Roth, D.: On the hardness of approximate reasoning. Artificial Intelligence 82, 273–302 (1996)

    CrossRef  MathSciNet  Google Scholar 

  25. van der Gaag, L.C.: Probability-Based Models for Plausible Reasoning. PhD thesis, University of Amsterdam (1990)

    Google Scholar 

  26. Wimer, T.V.: Linear Algorithms on k-Terminal Graphs. PhD thesis, Dept. of Computer Science, Clemson University (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Sciences, Utrecht University, P.O. Box 80.089, The Netherlands

    Marijke Hans L. Bodlaender

Authors
  1. Marijke Hans L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG, Amsterdam, The Netherlands

    Jos C. M. Baeten & Frank S. de Boer & 

  2. Microsoft Research, One Microsoft Way, 98052, Redmond, WA, USA

    Tom Ball

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Bodlaender, M.H.L. (2012). Probabilistic Inference and Monadic Second Order Logic. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds) Theoretical Computer Science. TCS 2012. Lecture Notes in Computer Science, vol 7604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33475-7_4

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-33475-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33474-0

  • Online ISBN: 978-3-642-33475-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature