Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1995: Mathematical Foundations of Computer Science 1995 pp 21–36Cite as

Decomposable structures, Boolean function representations, and optimization

  • Invited Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 969))

Abstract

We show the connection between the theory of bounded treewidth graphs, monadic second order definable structures and sets, and boolean decision diagrams. We survey recent results in algorithms for bounded treewidth, symbolic model checking and representation schemes for Boolean functions. Some practical applications are indicated.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. ARNBORG, Graph decompositions and tree automata in reasoning with uncertainty, Journal of Theoretical and Experimental Artificial Intelligence 5 (1993) 335–357

    Google Scholar 

  2. S. ARNBORG, Decomposability helps for logics of knowledge and belief. Graph Transformations in Computer Science, Dagstuhl 1993, LNCS 776 37–50.

    Google Scholar 

  3. S. ARNBORG, A general purpose MSOL model checker and optimizer based on Boolean function representations. presented at the Fifth International Workshop on Graph Grammars and Their Application to Computer Science, Williamsburg, Nov 1994. http://BMW.nada.kth.se/~ stefan

    Google Scholar 

  4. S. ARNBORG, B. COURCELLE A. PROSKUROWSKI AND D. SEESE, An Algebraic Theory of Graph Reduction, Journ. ACM 40 (1993) 1134–1164.

    Google Scholar 

  5. S. ARNBORG, J. LAGERGREN AND D. SEESE, Easy Problems for Tree-decomposable graphs J. of Algorithms 12 (1991) 308–340.

    Google Scholar 

  6. M. BAUDERON AND B. COURCELLE, Graph expressions and graph rewritings, Mathematical Systems Theory 20 (1987), 83–127

    Article  Google Scholar 

  7. H.L. BODLAENDER, Improved self-reduction algorithms for graphs with bounded treewidth. Discrete Applied Mathematics 54(1994) 101–116.

    Google Scholar 

  8. R. B. BORIE, Generation of polynomial time algorithms for some optimization problems on tree-decomposable graphs.

    Google Scholar 

  9. R. BRYANT, Graph Based Algorithms for Boolean Function Manipulation IEEE Trans. Computers C-35 (1986) 677–691.

    Google Scholar 

  10. R. BRYANT, Symbolic Boolean Manipulation with Ordered Bolean-Decision Diagrams. ACM Computing Surveys 24 (1992) 293–318.

    Article  Google Scholar 

  11. J. R. BURCH, E. M. CLARKE, K. L. McMILLAN, D.L. DILL AND L. J. HWANG, Symbolic Model Checking: 1020 states and beyond Information and Computation 98 (1992) 142–170.

    Article  Google Scholar 

  12. D.G. CORNEIL, H. LERCHS AND L. STEWART BURLINGHAM, Complement Reducible Graphs, Discrete Appl. Math. 3 (1981), 163–174.

    Google Scholar 

  13. B. COURCELLE, The monadic second order logic of graphs I: Recognizable sets of finite graphs, Information and Computation 85(1) March 1990, 12–75

    Article  Google Scholar 

  14. B. COURCELLE, Monadic second order definable graph transductions: a survey, Theoretical Computer Science 126(1994), 53–75

    MathSciNet  Google Scholar 

  15. B. COURCELLE AND M. MOSBAH, Monadic second order evaluations on tree-decomposable graphs, Theoretical Computer Science 109(1993), 49–82

    Google Scholar 

  16. Discrete Applied Mathematics54 (1994) 281-290.

    Google Scholar 

  17. J.E. DONER, Decidability of the Weak Second-Order theory of two Successors, Abstract 65T-468, Notices Amer. Math. Soc. 12 (1965), 819, ibid. (1966), 513

    Google Scholar 

  18. D. DUBOIS AND H. PRADE Inference in possibilistic hypergraphs. Proc. 3rd Int. Conf. Information Processing and Management of Uncertainty in Knowledge based Systems (IPMU), Paris, July 1990.

    Google Scholar 

  19. M.R. GAREY AND D.S. JOHNSON, Computers and Intractability, W.H. Freeman and Company, San Francisco (1979).

    Google Scholar 

  20. J.G. HENRIKSEN, O.J.L. JENSEN, M.E. JØRGENSEN, N. KLARLUND, R. PAIGE, T. RAUHE And A.B. SANDHOLM, MONA: Monadic Second-Order Logic in Practice. BRICS Report RS-95-21

    Google Scholar 

  21. K. L. McMILLAN, Hierarchical representations of discrete functions, with applications to model checking 6th International conference on Computer Aided Verification, LNCS 818 (1994) 41–54.

    Google Scholar 

  22. N. NILSSON, Probabilistic logic, Artificial Intelligence 28 (1986) 71–87

    Article  Google Scholar 

  23. R. PARIKH, On context-free languages, JACM 13(1966) 570–581

    Google Scholar 

  24. J. PEARL, Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann Publishers, Inc. San Mateo 1988

    Google Scholar 

  25. M.O. RABIN, Decidable theories, In Handbook of Mathematical Logic, ed. by K.J. Barwise, North-Holland Publishing Company, 1977 595–629.

    Google Scholar 

  26. P. SHENOY, A valuation-based language for expert systems. Int. Journal of Approximate Reasoning 3 (1989) 383–411.

    Google Scholar 

  27. P. SHENOY, G. SHAFER, Axioms for probability and belief function propagation, in Uncertainty in Artificial Intelligence 4 (R.D. Shachter, T.S. Levitt, L.N. Kanal, J.F.Lemmer, Eds.) Elsevier Science Publishers B.V. 1990.

    Google Scholar 

  28. J.R. SHOENFIELD, Mathematical Logic, Reading 1967, Addison-Wesley.

    Google Scholar 

  29. M. STARKEY AND R. BRYANT, Using Ordered Binary-Decision Diagrams for Compressing Images and Image Sequences, Carnegie Mellon University CMU-CS-95-105

    Google Scholar 

  30. J.W. THATCHER, J.B. WRIGHT, Generalized Finite Automata Theory with an Application to a Decision Problem in Second-Order Logic, Mathematical Systems Theory 2 (1968), 57–81.

    Google Scholar 

  31. E. WANKE On the decidability of certain integer subgraph problems on context-free graph languages, Information and Computation, 113 (1994) 26–49

    Google Scholar 

  32. E. WANKE k-NLC graphs and polynomial algorithms Discrete Applied Mathematics 54 (1994) 251–266.

    Google Scholar 

  33. T.V. WIMER, Linear algorithms on it-terminal graphs, PhD. Thesis, Clemson University (1988).

    Google Scholar 

  34. X. ZHOU, S. NAKANO AND T. NISHIZEKI, A Linear Algorithm for edge-coloring partial k-trees, ESA93, LNCS 726, 409–418.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kungliga Tekniska Högskolan NADA, S-100 44, Stockholm, Sverige

    Stefan Arnborg

Authors
  1. Stefan Arnborg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Wiedermann Petr Hájek

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arnborg, S. (1995). Decomposable structures, Boolean function representations, and optimization. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_110

Download citation

  • DOI: https://doi.org/10.1007/3-540-60246-1_110

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60246-0

  • Online ISBN: 978-3-540-44768-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation