{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:10:06Z","timestamp":1775873406451,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175813","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T17:18:23Z","timestamp":1689355103000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse"],"prefix":"10.1109","author":[{"given":"Diego","family":"Figueira","sequence":"first","affiliation":[{"name":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800,Talence,France,F-33400"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santiago","family":"Figueira","sequence":"additional","affiliation":[{"name":"Univ. Buenos Aires, FCEN, DC & CONICET-UBA, ICC,Argentina"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin","family":"Pin","sequence":"additional","affiliation":[{"name":"Univ. Buenos Aires, FCEN, DM & CONICET-UBA, ICC,Argentina"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","volume":"2500","author":"gr\u00e4del","year":"2003","journal-title":"Automata Logics and Infinite Games A Guide to Current Research"},{"key":"ref12","first-page":"368","article-title":"Tree automata, mu-calculus and determinacy (extended abstract)","author":"emerson","year":"0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1713"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1055"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933592"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380867"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465227"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382783"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2005.08.002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90046-1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90054-P"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30201-8_9"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.2178\/jsl\/1129642115","article-title":"2-exptime lower bounds for propositional dynamic logics with intersection","volume":"70","author":"lange","year":"2005","journal-title":"J Symb Log"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90205-6"},{"key":"ref8","first-page":"31","article-title":"Regular queries on graph databases","volume":"61","author":"reutter","year":"2017","journal-title":"Theoretical Computer Science"},{"key":"ref7","first-page":"176","article-title":"Containment of conjunctive regular path queries with inverse","author":"calvanese","year":"2000","journal-title":"Principles of Knowledge Representation and Reasoning (KR'92)"},{"key":"ref9","first-page":"404","article-title":"How to best nest regular path queries","volume":"1193","author":"bourhis","year":"2014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-0456-4_2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_23"},{"key":"ref6","first-page":"175","article-title":"Querying graph databases","author":"baeza","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1231082313"}],"event":{"name":"2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Boston, MA, USA","start":{"date-parts":[[2023,6,26]]},"end":{"date-parts":[[2023,6,29]]}},"container-title":["2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10175635\/10175671\/10175813.pdf?arnumber=10175813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T17:58:38Z","timestamp":1690912718000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175813\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175813","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}