On the Expressive Power of Graph Logic
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.
KeywordsOrder Variable Query Language Order Logic Winning Strategy Edge Label
Unable to display preview. Download preview PDF.
- [AFS98]Ajtai, M., Fagin, R., Stockmeyer, L.: The Closure of Monadic \(\cal NP\). In: Proc. of 13th STOC, pp. 309–318 (1998)Google Scholar
- [C90]Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. 2, pp. 194–242. Elsevier Science Publishers, Amsterdam (1990)Google Scholar
- [DGG04]Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and Complexity of Graph Logic, Imperial College, Department of Computing Technical Report 2004/3, Information and Computation (to appear)Google Scholar
- [EF95]Ebinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)Google Scholar