Tree-Verifiable Graph Grammars (2402.17015v2)
Abstract: Hyperedge-Replacement grammars (HR) have been introduced by Courcelle in order to extend the notion of context-free sets from words and trees to graphs of bounded tree-width. While for words and trees the syntactic restrictions that guarantee that the associated languages of words resp. trees are regular - and hence, MSO-definable - are known, the situation is far more complicated for graphs. Here, Courcelle proposed the notion of regular graph grammars, a syntactic restriction of HR grammars that guarantees the definability of the associated languages of graphs in Counting Monadic Second Order Logic (CMSO). However, these grammars are not complete in the sense that not every CMSO-definable set of graphs of bounded tree-width can be generated by a regular graph grammar. In this paper, we introduce a new syntactic restriction of HR grammars, called tree-verifiable graph grammars, and a new notion of bounded tree-width, called embeddable bounded tree-width, where the later restricts the trees of a tree-decomposition to be a subgraph of the analyzed graph. The main property of tree-verifiable graph grammars is that their associated languages are CMSO-definable and that the have bounded embeddable tree-width. We show further that they strictly generalize the regular graph grammars of Courcelle. Finally, we establish a completeness result, showing that every language of graphs that is CMSO-definable and of bounded embeddable tree-width can be generated by a tree-verifiable graph grammar.
- Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 2000.
- Mikolaj Bojanczyk. Languages recognised by finite semigroups, and their generalisationsto objects such as trees and graphs, with an emphasis on definability inmonadic second-order logic. CoRR, abs/2008.11635, 2020.
- J. Richard Büchi. Weak Second-Order Arithmetic and Finite Automata, pages398–424. Springer New York, New York, NY, 1990.
- A Spatial Logic for Querying Graphs. In Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno,Matthew Hennessy, Stephan Eidenbenz, and Ricardo Conejo, editors, Proceedings of the 29th International Colloquium onAutomata, Languages and Programming (ICALP’02), volume 2380 of Lecture Notes in Computer Science, pages 597–610. Springer, July 2002.
- Bruno Courcelle. The monadic second-order logic of graphs. i. recognizable sets offinite graphs. Inf. Comput., 85(1):12–75, 1990.
- Bruno Courcelle. The monadic second-order logic of graphs V: on closing the gapbetween definability and recognizability. Theor. Comput. Sci., 80(2):153–202, 1991.
- Graph Structure and Monadic Second-Order Logic: ALanguage-Theoretic Approach. Encyclopedia of Mathematics and its Applications. CambridgeUniversity Press, 2012.
- Concurrency, Graphs and Models, Essays Dedicated to UgoMontanari on the Occasion of His 65th Birthday, volume 5065 of LectureNotes in Computer Science. Springer, 2008.
- Amina Doumane. Regular expressions for tree-width 2 graphs. In Mikolaj Bojanczyk, Emanuela Merelli, and David P. Woodruff,editors, 49th International Colloquium on Automata, Languages, andProgramming, ICALP 2022, July 4-8, 2022, Paris, France, volume 229 of LIPIcs, pages 121:1–121:20. Schloss Dagstuhl - Leibniz-Zentrum fürInformatik, 2022.
- Path logics for querying graphs: Combining expressiveness andefficiency. In 30th Annual ACM/IEEE Symposium on Logic in ComputerScience, LICS 2015, Kyoto, Japan, July 6-10, 2015, pages 329–340. IEEEComputer Society, 2015.
- S. Greibach. A note on undecidable properties of formal languages. Math. Systems Theory, 2:1–6, 1968.
- The tree width of separation logic with recursive definitions. In Maria Paola Bonacina, editor, Automated Deduction - CADE-24- 24th International Conference on Automated Deduction, Lake Placid, NY, USA,June 9-14, 2013. Proceedings, volume 7898 of Lecture Notes in ComputerScience, pages 21–38. Springer, 2013.
- BI as an assertion language for mutable data structures. In Chris Hankin and Dave Schmidt, editors, Conference Record ofPOPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles ofProgramming Languages, London, UK, January 17-19, 2001, pages 14–26. ACM,2001.
- Generalized records and spatial conjunction in role logic. In Static Analysis, pages 361–376, Berlin, Heidelberg, 2004.Springer Berlin Heidelberg.
- Francesco Paoli. Substructural Logics: A Primer. Springer, Dordrecht, Netherland, 2002.
- John C. Reynolds. Separation logic: A logic for shared mutable data structures. In 17th IEEE Symposium on Logic in Computer Science (LICS2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings, pages 55–74.IEEE Computer Society, 2002.
- Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by GraphTransformations, Volume 1: Foundations. World Scientific, 1997.
- Parametric shape analysis via 3-valued logic. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium onPrinciples of Programming Languages, POPL ’99, page 105–118, New York, NY,USA, 1999. Association for Computing Machinery.
- The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61–80, 2009.
- Moshe Y. Vardi. The complexity of relational query languages (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theoryof Computing, STOC ’82, page 137–146, New York, NY, USA, 1982. Associationfor Computing Machinery.