Skip to main content

Graph Operations and Monadic Second-Order Logic: A Survey

  • Conference paper
  • First Online:
Logic for Programming and Automated Reasoning (LPAR 2000)

Part of the book series: Lecture Notes in Artificial Intelligence ((LNAI,volume 1955))

  • 397 Accesses

Abstract

We handle finite graphs in two ways, as relational structures on the one hand, and as algebraic objects, i.e., as elements of algebras, based on graph operations on the other.

This research is supported by the European Community Training and Mobility in Research network GETGRATS.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. D. Corneil, M. Habib, J. M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width at most 3 graphs, Conference LATIN 2000, to appear.

    Google Scholar 

  2. B. Courcelle: The expression of graph properties and graph transformations in monadic second-order logic, Chapter 5 of the “Handbook of graph grammars and computing by graph transformations, Vol. 1: Foundations”, G. Rozenberg ed., World Scientific (New-Jersey, London), 1997, pp. 313–400.

    Google Scholar 

  3. B. Courcelle: The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantifications, 2000, submitted.

    Google Scholar 

  4. B. Courcelle: Clique-width of countable graphs: a compactness property. International Conference of Graph Theory, Marseille, 2000.

    Google Scholar 

  5. B. Courcelle, J. Makowsky: Operations on relational structures and their compatibility with monadic second-order logic, 2000, submitted.

    Google Scholar 

  6. B. Courcelle, J. Makowsky, U. Rotics: Linear time solvable optimization problems on certain structured graph families Theory of Computer Science (formerly Mathematical Systems Theory) 33 (2000) 125–150.

    Article  MATH  MathSciNet  Google Scholar 

  7. B. Courcelle, S. Olariu: Upper bounds to the clique-width of graphs, Discrete Applied Mathematics 101 (2000) 77–114.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Courcelle, B. (2000). Graph Operations and Monadic Second-Order Logic: A Survey. In: Parigot, M., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 2000. Lecture Notes in Artificial Intelligence(), vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44404-1_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-44404-1_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41285-4

  • Online ISBN: 978-3-540-44404-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics