{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:57:45Z","timestamp":1759683465837,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2448496.2448512","type":"proceedings-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T13:34:53Z","timestamp":1363700093000},"page":"117-128","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Walk logic as a framework for path query languages on graph databases"],"prefix":"10.1145","author":[{"given":"Jelle","family":"Hellings","sequence":"first","affiliation":[{"name":"Hasselt University and transnational University of Limburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Kuijpers","sequence":"additional","affiliation":[{"name":"Hasselt University and transnational University of Limburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Van den Bussche","sequence":"additional","affiliation":[{"name":"Hasselt University and transnational University of Limburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Hasselt University and transnational University of Limburg"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Foundations of Databases","author":"Abiteboul S.","year":"1995","unstructured":"S. Abiteboul , R. Hull , and V. Vianu . Foundations of Databases . Addison-Wesley , 1995 . S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1322432.1322433"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/2695090"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187922"},{"key":"e_1_3_2_1_5_1","volume-title":"Principles of Model Checking","author":"Baier C.","year":"2008","unstructured":"C. Baier and J.-P. Katoen . Principles of Model Checking . MIT Press , 2008 . C. Baier and J.-P. Katoen. Principles of Model Checking. MIT Press, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807089"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings 6th Alberto Mendelzon International Workshop on Foundations of Data Management","volume":"866","author":"Barcel\u00f3 P.","year":"2012","unstructured":"P. Barcel\u00f3 , J. P\u00e9rez , and J. L. Reutter . Relative expressiveness of nested regular expressions. In J. Freire and D. Suciu, editors , Proceedings 6th Alberto Mendelzon International Workshop on Foundations of Data Management , volume 866 of CEUR Workshop Proceedings, pages 180--195 , 2012 . P. Barcel\u00f3, J. P\u00e9rez, and J. L. Reutter. Relative expressiveness of nested regular expressions. In J. Freire and D. Suciu, editors, Proceedings 6th Alberto Mendelzon International Workshop on Foundations of Data Management, volume 866 of CEUR Workshop Proceedings, pages 180--195, 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00034-X"},{"key":"e_1_3_2_1_9_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/978-3-642-15205-4_12","volume-title":"Computer Science Logic","author":"Benedikt M.","year":"2010","unstructured":"M. Benedikt , C. Ley , and G. Puppis . Automata vs logics on data words . In A. Dawar and H. Veith, editors, Computer Science Logic , volume 6247 of Lecture Notes in Computer Science , pages 110 -- 124 . Springer , 2010 . M. Benedikt, C. Ley, and G. Puppis. Automata vs logics on data words. In A. Dawar and H. Veith, editors, Computer Science Logic, volume 6247 of Lecture Notes in Computer Science, pages 110--124. Springer, 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876642"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzp021"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1970398.1970403"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/959060.959076"},{"key":"e_1_3_2_1_14_1","volume-title":"Model Checking","author":"Clarke E. M.","year":"2000","unstructured":"E. M. Clarke , O. Grumberg , and D. A. Peled . Model Checking . MIT Press , 2000 . E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298591"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2414243"},{"key":"e_1_3_2_1_17_1","first-page":"47","article-title":"Second-order and inductive definability on finite structures. Zeitschr. f. math. Logik und Grundlagen d","volume":"33","author":"de Rougemont Michel","year":"1987","unstructured":"Michel de Rougemont . Second-order and inductive definability on finite structures. Zeitschr. f. math. Logik und Grundlagen d . Math. , 33 : 47 -- 63 , 1987 . Michel de Rougemont. Second-order and inductive definability on finite structures. Zeitschr. f. math. Logik und Grundlagen d. Math., 33:47--63, 1987.","journal-title":"Math."},{"key":"e_1_3_2_1_18_1","first-page":"261","volume-title":"Logic and Automata, History and Perspectives","author":"Diekert V.","year":"2008","unstructured":"V. Diekert and P. Gastin . First-order definable languages . In J. Flum, E. Gr\u00e4del, and T. Wilke, editors, Logic and Automata, History and Perspectives , pages 261 -- 306 . Amsterdam University Press , 2008 . V. Diekert and P. Gastin. First-order definable languages. In J. Flum, E. Gr\u00e4del, and T. Wilke, editors, Logic and Automata, History and Perspectives, pages 261--306. Amsterdam University Press, 2008."},{"key":"e_1_3_2_1_19_1","volume-title":"Springer","author":"Diestel R.","year":"2010","unstructured":"R. Diestel . Graph Theory . Springer , fourth edition, 2010 . R. Diestel. Graph Theory. Springer, fourth edition, 2010."},{"key":"e_1_3_2_1_20_1","volume-title":"Finite Model Theory","author":"Ebbinghaus H.-D.","year":"1999","unstructured":"H.-D. Ebbinghaus and J. Flum . Finite Model Theory . Springer , second edition, 1999 . H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, second edition, 1999."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2005.06.010"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings 5th Alberto Mendelzon International Workshop on Foundations of Data Management","volume":"749","author":"Freydenberger D. D.","year":"2011","unstructured":"D. D. Freydenberger and N. Schweikardt . Expressiveness and static analysis of extended conjunctive regular path queries. In P. Barcel\u00f3 and V. Tannen, editors , Proceedings 5th Alberto Mendelzon International Workshop on Foundations of Data Management , volume 749 of CEUR Workshop Proceedings , 2011 . D. D. Freydenberger and N. Schweikardt. Expressiveness and static analysis of extended conjunctive regular path queries. In P. Barcel\u00f3 and V. Tannen, editors, Proceedings 5th Alberto Mendelzon International Workshop on Foundations of Data Management, volume 749 of CEUR Workshop Proceedings, 2011."},{"key":"e_1_3_2_1_24_1","volume-title":"Handbook of Modal Logic","author":"Goranko V.","year":"2007","unstructured":"V. Goranko and M. Otto . Model theory of modal logic . In P. Blackburn, J. van Benthem, and F. Wolter, editors, Handbook of Modal Logic , chapter 5. Elsevier , 2007 . V. Goranko and M. Otto. Model theory of modal logic. In P. Blackburn, J. van Benthem, and F. Wolter, editors, Handbook of Modal Logic, chapter 5. Elsevier, 2007."},{"key":"e_1_3_2_1_25_1","volume-title":"Finite Model Theory and Its Applications","author":"Gr\u00e4del E.","year":"2007","unstructured":"E. Gr\u00e4del , Ph. Kolaitis , L. Libkin , M. Marx , J. Spencer , M. Vardi , Y. Venema , and S. Weinstein . Finite Model Theory and Its Applications . Springer , 2007 . E. Gr\u00e4del, Ph. Kolaitis, L. Libkin, M. Marx, J. Spencer, M. Vardi, Y. Venema, and S. Weinstein. Finite Model Theory and Its Applications. Springer, 2007."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"T.\n      Hafer\n     and \n      W.\n      Thomas\n  . \n  Computation tree logic and path quantifiers in the monadic theory of the binary tree\n  . In T. Ottmann editor Automata Languages\n   and Programming 14th International Colloquium volume \n  267\n   of \n  Lecture Notes in Computer Science pages \n  269\n  --\n  279\n  . \n  Springer 1987\n  .   T. Hafer and W. Thomas. Computation tree logic and path quantifiers in the monadic theory of the binary tree. In T. Ottmann editor Automata Languages and Programming 14th International Colloquium volume 267 of Lecture Notes in Computer Science pages 269--279. Springer 1987.","DOI":"10.1007\/3-540-18088-5_22"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"N. Immerman. Descriptive Complexity. Springer 1999.  N. Immerman. Descriptive Complexity . Springer 1999.","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"e_1_3_2_1_28_1","unstructured":"Ph.G. Kolaitis. On the expressive power of logics on finite models. In Finite Model Theory and Its Applications {25} chapter 2.  Ph.G. Kolaitis. On the expressive power of logics on finite models. In Finite Model Theory and Its Applications {25} chapter 2."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1024196"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213573"},{"key":"e_1_3_2_1_31_1","volume-title":"Counter-Free Automata","author":"McNaughton R.","year":"1971","unstructured":"R. McNaughton and S. Papert . Counter-Free Automata . MIT Press , 1971 . R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, 1971."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00104-4"},{"key":"e_1_3_2_1_33_1","series-title":"Lecture Note Series","volume-title":"Finite and Algorithmic Model Theory","author":"Otto M.","year":"2011","unstructured":"M. Otto . Model theoretic methods for fragments of FO and special classes of (finite) structures . In J. Esparza, C. Michaux, and C. Steinhorn, editors, Finite and Algorithmic Model Theory , volume 379 of Lecture Note Series , chapter 7. London Mathematical Society , 2011 . M. Otto. Model theoretic methods for fragments of FO and special classes of (finite) structures. In J. Esparza, C. Michaux, and C. Steinhorn, editors, Finite and Algorithmic Model Theory, volume 379 of Lecture Note Series, chapter 7. London Mathematical Society, 2011."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/267871.267878"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10849-009-9093-x"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2206869.2206879"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10373-5_15"}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","acronym":"EDBT\/ICDT '13","location":"Genoa Italy"},"container-title":["Proceedings of the 16th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448512","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2448496.2448512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:51Z","timestamp":1750238451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":38,"alternative-id":["10.1145\/2448496.2448512","10.1145\/2448496"],"URL":"https:\/\/doi.org\/10.1145\/2448496.2448512","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}