Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
Author(s): Bruno Courcelle (Author), Joost Engelfriet (Author)
Publisher: Cambridge University Press
Publication Date: July 23, 2012
Edition: 1st
Language: English
Print length: 744 pages
ISBN-10: 0521898331
ISBN-13: 9780521898331
Book Description
The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The author not only provides a thorough description of the theory, but also details its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.
Editorial Reviews
Review
“In its huge breadth and depth the authors manage to provide a comprehensive study of monadic second-order logic on graphs covering almost all aspects of the theory that can be presented from a language theoretical or algebraic point of view. There is currently no other textbook or any other source that matches the range of materials covered in this book. As such it is a fantastic resource for those who to study this area [and] will undoubtedly turn into the standard reference for this area.” Stephan Kreutzer, Mathematical Reviews
Book Description
This book unifies and synthesizes research on graph structure over the last 25 years. The definitive reference for graduate students and researchers.
About the Author
Bruno Courcelle is a Professor at Bordeaux 1 University and a member of LaBRI (the Bordeaux Laboratory of Computer Science, CNRS) and of the Institut Universitaire de France. After studying at the École Normale Supérieure, he was a researcher at INRIA (1972–8), before becoming a Professor at Bordeaux in 1979. He obtained his PhD (supervised by M. Nivat), in 1976. He is on the editorial boards for the journals Information and Computation and Logical Methods in Computer Science.