Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
The closure of Monadic NP (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Toolkit for First Order Extensions of Monadic Games
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Expressiveness and complexity of graph logic
Information and Computation
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Separating Graph Logic from MSO
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
| Hi-index | 0.00 |
Graph Logic, a query language being a sublogic of Monadic Second Order Logic is studied in [CGG02]. In the paper [DGG04] the expressiveness power of Graph Logic is examined, and it is shown, for many MSO properties, how to express them in Graph Logic. But despite of the positive examples, it is conjectured there that Graph Logic is strictly less expressive than MSO Logic. Here we give a proof of this conjecture.