| Alternate document: Details On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic (97) Bruno Courcelle |
B. Courcelle  Home/Search
Context Related
| deptinfo.labri.uborde...GragraBook.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: deptinfo.labri.ubordea...ActSci (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: By considering graphs as logical structures, one... (Update)
Cited by: More
The complete list of RTA open problems - Date April Summary (Correct)
Expressiveness and Complexity of Graph Logic - Anuj Dawar Philippa (2004) (Correct)
Existential Heap Abstraction Entailment is Undecidable - Kuncak, Rinard (2003) (Correct)
Active bibliography (related documents): More All
1.1: Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996) (Correct)
0.5: A Perspective on Lindström Quantifiers and Oracles - Stewart (Correct)
0.4: Normal Forms for Context-Free Node-Rewriting Hypergraph Grammars - Klempien-Hinrichs (Correct)
Similar documents based on text: More All
0.5: On the Logical Hierarchy of Graphs - Ly (Correct)
0.3: Operations on Relational Structures and their Compatibility .. - Courcelle, Makowsky (2000) (Correct)
0.3: The Monadic Second-Order Logic of Graphs XIV: Uniformly sparse.. - Courcelle (1999) (Correct)
Related documents from co-citation: More All
21: Easy problems for tree-decomposable graphs - Arnborg, Lagergren et al. - 1991
16: Monadic second-order evaluations on tree-decomposable graphs (context) - Courcelle, Mosbah - 1993
14: Upper bounds to the clique-width of graphs - Courcelle, Olariu - 1997
BibTeX entry: (Update)
B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of graph grammars and computing by graph transformations, Vol. 1 : Foundations, chapter 5, pages 313--400. World Scientific, 1997. http://citeseer.ist.psu.edu/courcelle97expression.html More
@incollection{ courcelle97expression,
author = "Bruno Courcelle",
title = "The Expression Of Graph Properties And Graph Transformations In Monadic Second-Order Logic",
booktitle = "Handbook of graph grammars and computing by graph transformations, vol.~1: Foundations",
publisher = "World Scientific",
address = "New-Jersey, London",
editor = "G. Rozenberg",
pages = "313--400",
year = "1997",
url = "citeseer.ist.psu.edu/courcelle97expression.html" }
Citations (may not include all citations):775 Foundations of Data bases (context) - HULL, VIANU - 1994
81 Handbook of Theoretical Computer Science (context) - Automata, objects - 1990
51 Monadic second-order evaluations on treedecomposable graphs (context) - MOSBAH - 1993
49 Fundamentals of algebraic specications 1 : equations and ini.. (context) - MAHR - 1985
49 Excluding a planar graph (context) - SEYMOUR, Graph - 1986
48 Handle-rewriting hypergraph grammars (context) - ENGELFRIET, ROZENBERG - 1993
47 Hyperedge replacement graph grammars (context) - HABEL, KREOWSKI
46 Akademiai Kiado (context) - STEINBY, Tree - 1984
46 Handbook of Theoretical Computer Science (context) - Algebraic - 1990
44 Algebraic automata and context-free sets (context) - WRIGHT - 1967
36 Problems easy for tree-decomposable graphs (context) - LAGERGREN, SEESE - 1991
31 Generalized nite automata theory with an application to a de.. (context) - WRIGHT - 1968
26 Mathematical Systems Theory (context) - COURCELLE, Graph et al. - 1987
25 An analogue of the Myhill-Nerode theorem and its use in comp.. (context) - LANGSTON - 1989
21 The string generating power of context-free hypergraph gramm.. (context) - HEYKER - 1991
19 Graph minors XX : Wagner's conjecture (context) - SEYMOUR - 1988
19 Graph grammars based on node rewriting : an introduction to .. (context) - ROZENBERG - 1991
18 Node replacement graph grammars (context) - ROZENBERG
12 Information and Control (context) - WELZL, Boundary et al. - 1986
11 Two families of languages related to ALGOL (context) - RICE - 1962
8 Hypergraph languages of bounded degree (context) - HEYKER - 1994
7 The rst-order properties of products of algebraic systems (context) - VAUGHT - 1959
7 Decidability of the con uence of nite ground term rewrite sy.. (context) - HEUILLARD, LESCANNE et al. - 1990
6 monadic second-order logic and the theory of graph minors in.. (context) - Graph - 1993
5 A Kleene theorem for a class of planar acyclic graphs (context) - DAUCHET, WARIN - 1995
5 A logical characterization of the sets of hypergraphs dened .. (context) - ENGELFRIET - 1995
3 Finding minimal forbidden minors using a nite congruence (context) - ARNBORG - 1991
1 to appear in Annals of Mathematics and Articial Intelligence (context) - Logic, automata
1 The obstructions of minor-closed sets of graphs dened by a c.. (context) - SENIZERGUES - 1994
1 a new complexity measure on graphs (context) - OLARIU, Clique-width - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://dept-info.labri.u-bordeaux.fr/~courcell/ActSci.html): More
The Monadic Second-Order Logic of Graphs XIV: Uniformly sparse.. - Courcelle (1999) (Correct)
The Monadic Second-Order Logic of Graphs XII : Planar graphs and .. - Courcelle (1998) (Correct)
Monadic Second-Order Logic, Graph Coverings and.. - Courcelle, Walukiewicz (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC