{"id":"https://openalex.org/W2036564813","doi":"https://doi.org/10.1145/1516512.1516515","title":"Two-variable logic on data trees and XML reasoning","display_name":"Two-variable logic on data trees and XML reasoning","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2036564813","doi":"https://doi.org/10.1145/1516512.1516515","mag":"2036564813"},"language":"en","primary_location":{"id":"doi:10.1145/1516512.1516515","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1516512.1516515","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Mikoaj Boja\u0144czyk","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Mikoaj Boja\u0144czyk","raw_affiliation_strings":["Warsaw University, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Warsaw University, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044780614","display_name":"Anca Muscholl","orcid":"https://orcid.org/0000-0002-8214-204X"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Anca Muscholl","raw_affiliation_strings":["LABRI & Universit\u00e9 Bordeaux 1, Bordeaux, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LABRI & Universit\u00e9 Bordeaux 1, Bordeaux, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210160189","https://openalex.org/I4210142254"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031710345","display_name":"Thomas Schwentick","orcid":"https://orcid.org/0000-0002-1062-922X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Schwentick","raw_affiliation_strings":["Universit\u00e4t Dortmund, Dortmund, Germany","Universit\u00e4t Dortmund Dortmund Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Universit\u00e4t Dortmund Dortmund Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042411667","display_name":"Luc Segoufin","orcid":"https://orcid.org/0000-0002-9564-7581"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Luc Segoufin","raw_affiliation_strings":["INRIA & LSV, Cachan, France","INRIA & LSV, Cachan, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA & LSV, Cachan, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA & LSV, Cachan, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.2411,"has_fulltext":false,"cited_by_count":144,"citation_normalized_percentile":{"value":0.99172754,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"56","issue":"3","first_page":"1","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.6068999767303467,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.6068999767303467,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.10109999775886536,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.06870000064373016,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/xpath","display_name":"XPath","score":0.8535296320915222},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8020654916763306},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7546228170394897},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.7158676385879517},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6182007193565369},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5208694934844971},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48820096254348755},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.43901488184928894},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.43712693452835083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4309956431388855},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4104098677635193},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.39003127813339233},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3680962324142456},{"id":"https://openalex.org/keywords/xml-validation","display_name":"XML validation","score":0.21008658409118652},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20644202828407288}],"concepts":[{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.8535296320915222},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8020654916763306},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7546228170394897},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7158676385879517},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6182007193565369},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5208694934844971},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48820096254348755},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.43901488184928894},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.43712693452835083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4309956431388855},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4104098677635193},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39003127813339233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3680962324142456},{"id":"https://openalex.org/C55348073","wikidata":"https://www.wikidata.org/wiki/Q595926","display_name":"XML validation","level":3,"score":0.21008658409118652},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20644202828407288},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1516512.1516515","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1516512.1516515","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G2222101336","display_name":null,"funder_award_id":"SCHW 678/3-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1488636480","https://openalex.org/W1536883094","https://openalex.org/W1568320863","https://openalex.org/W1591926286","https://openalex.org/W1619948012","https://openalex.org/W1856962451","https://openalex.org/W1970599921","https://openalex.org/W1988662949","https://openalex.org/W2006634201","https://openalex.org/W2040295920","https://openalex.org/W2056665285","https://openalex.org/W2081396910","https://openalex.org/W2103658959","https://openalex.org/W2111714843","https://openalex.org/W2117789898","https://openalex.org/W2131159347","https://openalex.org/W2134286919","https://openalex.org/W2137935204","https://openalex.org/W2157148396","https://openalex.org/W2160888032","https://openalex.org/W2163483558","https://openalex.org/W2174576875","https://openalex.org/W2292993340","https://openalex.org/W2611888112","https://openalex.org/W2673028924"],"related_works":["https://openalex.org/W1517932751","https://openalex.org/W2187310579","https://openalex.org/W2040509999","https://openalex.org/W1486715727","https://openalex.org/W1545660605","https://openalex.org/W2401586919","https://openalex.org/W1965531865","https://openalex.org/W3033862888","https://openalex.org/W3080160234","https://openalex.org/W2743317844"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"reasoning":[2],"tasks":[3],"for":[4,44,86,97],"XML":[5],"languages,":[6],"the":[7,51,59,62,67,94],"satisfiability":[8,43,83],"problem":[9,96],"of":[10,19,82,90,93],"logics":[11],"on":[12],"data":[13,21,32,70],"trees":[14],"is":[15,40,48,72,103],"investigated.":[16],"The":[17],"nodes":[18],"a":[20,24,27,31,35,87],"tree":[22,52],"have":[23],"label":[25],"from":[26,34],"finite":[28],"set":[29],"and":[30,61,66,84,92,100],"value":[33],"possibly":[36],"infinite":[37],"set.":[38],"It":[39],"shown":[41],"that":[42],"two-variable":[45],"first-order":[46],"logic":[47],"decidable":[49],"if":[50],"structure":[53],"can":[54],"be":[55],"accessed":[56],"only":[57],"through":[58],"child":[60],"next":[63],"sibling":[64],"predicates":[65],"access":[68],"to":[69,74],"values":[71],"restricted":[73],"equality":[75],"tests.":[76],"From":[77],"this":[78],"main":[79],"result,":[80],"decidability":[81],"containment":[85],"data-aware":[88],"fragment":[89],"XPath":[91],"implication":[95],"unary":[98],"key":[99],"inclusion":[101],"constraints":[102],"concluded.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2023,"cited_by_count":23},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":16}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}