{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T11:45:00Z","timestamp":1769600700957,"version":"3.49.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Polish government","award":["N206 008 32\/0810"],"award-info":[{"award-number":["N206 008 32\/0810"]}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SCHW 678\/3-1"],"award-info":[{"award-number":["SCHW 678\/3-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2009,5]]},"abstract":"<jats:p>\n            Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on\n            <jats:italic>data trees<\/jats:italic>\n            is investigated. The nodes of a data tree have a\n            <jats:italic>label<\/jats:italic>\n            from a finite set and a\n            <jats:italic>data value<\/jats:italic>\n            from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed only through the\n            <jats:italic>child<\/jats:italic>\n            and the\n            <jats:italic>next sibling<\/jats:italic>\n            predicates and the access to data values is restricted to equality tests. From this main result, decidability of satisfiability and containment for a data-aware fragment of XPath and of the implication problem for unary key and inclusion constraints is concluded.\n          <\/jats:p>","DOI":"10.1145\/1516512.1516515","type":"journal-article","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T16:47:42Z","timestamp":1242751662000},"page":"1-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":91,"title":["Two-variable logic on data trees and XML reasoning"],"prefix":"10.1145","volume":"56","author":[{"given":"Mikoaj","family":"Boja\u0144czyk","sequence":"first","affiliation":[{"name":"Warsaw University, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[{"name":"LABRI &amp; Universit\u00e9 Bordeaux 1, Bordeaux, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Dortmund, Dortmund, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Segoufin","sequence":"additional","affiliation":[{"name":"INRIA &amp; LSV, Cachan, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00032-1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-540-30597-2_2","volume-title":"Inconsistency Tolerance. Lecture Notes in Computer Science","volume":"3300","author":"Arenas M.","unstructured":"Arenas , M. , Fan , W. , and Libkin , L . 2005. Consistency of XML specifications . In Inconsistency Tolerance. Lecture Notes in Computer Science , vol. 3300 . Springer-Verlag, New York , pp. 15 -- 41 . Arenas, M., Fan, W., and Libkin, L. 2005. Consistency of XML specifications. In Inconsistency Tolerance. Lecture Notes in Computer Science, vol. 3300. Springer-Verlag, New York, pp. 15--41."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1456650.1456653"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065172"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.51"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00038-5"},{"key":"e_1_2_1_7_1","unstructured":"Br\u00fcggemann-Klein A. Wood D. and Murata M. 2001. Regular tree and regular hedge languages over unranked alphabets. Technical report April. http:\/\/citeseer.ist.psu.edu\/451005.html.  Br\u00fcggemann-Klein A. Wood D. and Murata M. 2001. Regular tree and regular hedge languages over unranked alphabets. Technical report April. http:\/\/citeseer.ist.psu.edu\/451005.html."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(03)00028-0"},{"key":"e_1_2_1_9_1","volume-title":"RTA'04","volume":"3091","author":"Carme J.","unstructured":"Carme , J. , Niehren , J. , and Tommasi , M . 2004. Querying unranked trees with stepwise tree automata . In RTA'04 . Lecture Notes in Computer Science , vol. 3091 . Springer-Verlag, New York, 105--118. Carme, J., Niehren, J., and Tommasi, M. 2004. Querying unranked trees with stepwise tree automata. In RTA'04. Lecture Notes in Computer Science, vol. 3091. Springer-Verlag, New York, 105--118."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11537311_7"},{"key":"e_1_2_1_11_1","unstructured":"David C. 2004. Mots et donn\u00e9es infinis. Master thesis Universit\u00e9 Paris 7 LIAFA.  David C. 2004. Mots et donn\u00e9es infinis. Master thesis Universit\u00e9 Paris 7 LIAFA."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018438.1021843"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2005.28"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.31"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2953"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/567112.567117"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11601524_8"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the Symposium on Very Large Data Bases (VLDB'02)","author":"Gottlob G.","unstructured":"Gottlob , G. , Koch , C. , and Pichler , R . 2002. Efficient algorithms for processing XPath queries . In Proceedings of the Symposium on Very Large Data Bases (VLDB'02) . San Francisco, CA, 95--106. Gottlob, G., Koch, C., and Pichler, R. 2002. Efficient algorithms for processing XPath queries. In Proceedings of the Symposium on Very Large Data Bases (VLDB'02). San Francisco, CA, 95--106."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00308-9"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.11"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.49"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11601524_15"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_8"},{"key":"e_1_2_1_25_1","first-page":"135","article-title":"On languages with two variables. Zeitschr. f. math. Logik u. Grundlagen d","volume":"21","author":"Mortimer M.","year":"1975","unstructured":"Mortimer , M. 1975 . On languages with two variables. Zeitschr. f. math. Logik u. Grundlagen d . Math. 21 , 135 -- 140 . Mortimer, M. 1975. On languages with two variables. Zeitschr. f. math. Logik u. Grundlagen d. Math. 21, 135--140.","journal-title":"Math."},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Neven F. and \n      Schwentick T\n  . \n  2003\n  . XPath containment in the presence of disjunction DTDs and variables. In ICDT'03 Lecture Notes in Computer Science vol. \n  2572\n  . \n  Springer-Verlag Berlin Germany 315--329.   Neven F. and Schwentick T. 2003. XPath containment in the presence of disjunction DTDs and variables. In ICDT'03 Lecture Notes in Computer Science vol. 2572. Springer-Verlag Berlin Germany 315--329.","DOI":"10.1007\/3-540-36285-1_21"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00301-2"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11532231_25"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013560.1013562"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322287"},{"key":"e_1_2_1_31_1","volume-title":"W3C Recommendation","author":"Path Language","year":"1999","unstructured":"XML Path Language (XPath) , W3C Recommendation 16 November 1999 . Available at http:\/\/www.w3.org\/TR\/xpath. XML Path Language (XPath), W3C Recommendation 16 November 1999. Available at http:\/\/www.w3.org\/TR\/xpath."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1516512.1516515","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1516512.1516515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:06Z","timestamp":1750253406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1516512.1516515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["10.1145\/1516512.1516515"],"URL":"https:\/\/doi.org\/10.1145\/1516512.1516515","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]},"assertion":[{"value":"2007-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}