{"id":"https://openalex.org/W2127397152","doi":"https://doi.org/10.1145/1938551.1938558","title":"Efficient reasoning about data trees via integer linear programming","display_name":"Efficient reasoning about data trees via integer linear programming","publication_year":2011,"publication_date":"2011-02-08","ids":{"openalex":"https://openalex.org/W2127397152","doi":"https://doi.org/10.1145/1938551.1938558","mag":"2127397152"},"language":"en","primary_location":{"id":"doi:10.1145/1938551.1938558","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1938551.1938558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Database Theory","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00720672v1/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074428781","display_name":"Claire David","orcid":"https://orcid.org/0000-0002-4729-0733"},"institutions":[{"id":"https://openalex.org/I2800365227","display_name":"Paris-Est Sup","ror":"https://ror.org/0268ecp52","country_code":"FR","type":"education","lineage":["https://openalex.org/I2800365227"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Claire David","raw_affiliation_strings":["Universit\u00e9 Paris-Est"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Est","institution_ids":["https://openalex.org/I2800365227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069883356","display_name":"Leonid Libkin","orcid":"https://orcid.org/0000-0002-6698-2735"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Leonid Libkin","raw_affiliation_strings":["University of Edinburgh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060686021","display_name":"Tony Tan","orcid":"https://orcid.org/0009-0005-8341-2004"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tony Tan","raw_affiliation_strings":["University of Edinburgh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074428781"],"corresponding_institution_ids":["https://openalex.org/I2800365227"],"apc_list":null,"apc_paid":null,"fwci":4.0207,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.9395478,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"18","last_page":"29"},"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.9973999857902527,"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.9973999857902527,"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/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.9169676303863525},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.7286577820777893},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6514586210250854},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6267095804214478},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.520555317401886},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.48237696290016174},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.4308660924434662},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42052406072616577},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3798617422580719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3396376669406891},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3255884051322937},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14474081993103027}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9169676303863525},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.7286577820777893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6514586210250854},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6267095804214478},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.520555317401886},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.48237696290016174},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.4308660924434662},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42052406072616577},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3798617422580719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3396376669406891},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3255884051322937},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14474081993103027},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1938551.1938558","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1938551.1938558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Conference on Database Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00720672v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00720672","pdf_url":"https://hal.science/hal-00720672v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Database Theory (ICDT), Mar 2011, Uppsala, Sweden. pp.18-29, ⟨10.1145/1938551.1938558⟩","raw_type":"Conference papers"},{"id":"pmh:oai:pure.ed.ac.uk:publications/f4b55d94-61ff-479a-bb1b-b8532a300799","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11820/f4b55d94-61ff-479a-bb1b-b8532a300799","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"David, C, Libkin, L & Tan, T 2011, Efficient reasoning about data trees via integer linear programming. in Database Theory - ICDT 2011, 14th International Conference. pp. 18-29. https://doi.org/10.1145/1938551.1938558","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00720672v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00720672","pdf_url":"https://hal.science/hal-00720672v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Database Theory (ICDT), Mar 2011, Uppsala, Sweden. pp.18-29, ⟨10.1145/1938551.1938558⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4916514355","display_name":null,"funder_award_id":"G049165","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G582362311","display_name":null,"funder_award_id":"FP7-ICT-233599","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"},{"id":"https://openalex.org/G7537944442","display_name":null,"funder_award_id":"EP/G049165/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320332","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320338370","display_name":"FP7 Information and Communication Technologies","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2127397152.pdf","grobid_xml":"https://content.openalex.org/works/W2127397152.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W1479863711","https://openalex.org/W1494939852","https://openalex.org/W1516630410","https://openalex.org/W1569718229","https://openalex.org/W1579407214","https://openalex.org/W1585533089","https://openalex.org/W1593799327","https://openalex.org/W1594696993","https://openalex.org/W1594719668","https://openalex.org/W1619948012","https://openalex.org/W1886070468","https://openalex.org/W1970599921","https://openalex.org/W1971729277","https://openalex.org/W1981870753","https://openalex.org/W1982213843","https://openalex.org/W1988662949","https://openalex.org/W1992381179","https://openalex.org/W1999396796","https://openalex.org/W2016521643","https://openalex.org/W2036564813","https://openalex.org/W2038925304","https://openalex.org/W2040295920","https://openalex.org/W2047551518","https://openalex.org/W2052432706","https://openalex.org/W2053455078","https://openalex.org/W2056665285","https://openalex.org/W2073614038","https://openalex.org/W2078015341","https://openalex.org/W2099318732","https://openalex.org/W2103658959","https://openalex.org/W2111789076","https://openalex.org/W2139258089","https://openalex.org/W2142529424","https://openalex.org/W2147973254","https://openalex.org/W2157148396","https://openalex.org/W2162199371","https://openalex.org/W2162593546","https://openalex.org/W2177814128","https://openalex.org/W2294034341","https://openalex.org/W2338546432","https://openalex.org/W2673028924","https://openalex.org/W3141776272","https://openalex.org/W3148190347","https://openalex.org/W4285719527","https://openalex.org/W6628682275","https://openalex.org/W6634622667","https://openalex.org/W6634978497","https://openalex.org/W6635485671"],"related_works":["https://openalex.org/W57206970","https://openalex.org/W4235091896","https://openalex.org/W2185981755","https://openalex.org/W2023896637","https://openalex.org/W2498253392","https://openalex.org/W2996527951","https://openalex.org/W3185974462","https://openalex.org/W1585688349","https://openalex.org/W4302416657","https://openalex.org/W1995465248"],"abstract_inverted_index":{"Data":[0],"trees":[1,14],"provide":[2],"a":[3],"standard":[4],"abstraction":[5],"of":[6,58],"XML":[7],"documents":[8],"with":[9],"data":[10,41],"values:":[11],"they":[12,54],"are":[13,45,66,70],"whose":[15],"nodes,":[16],"in":[17,35,73],"addition":[18],"to":[19,56],"the":[20,50],"usual":[21],"labels,":[22],"can":[23],"carry":[24],"labels":[25],"from":[26],"an":[27],"infinite":[28],"alphabet":[29],"(data).":[30],"Therefore,":[31],"one":[32],"is":[33],"interested":[34,72],"decidable":[36],"formalisms":[37,76],"for":[38,82],"reasoning":[39],"about":[40],"trees.":[42],"While":[43],"some":[44],"known":[46],"--":[47,53],"such":[48],"as":[49,77,79],"two-variable":[51],"logic":[52],"tend":[55],"be":[57],"very":[59],"high":[60],"complexity,":[61],"and":[62],"most":[63],"decidability":[64],"proofs":[65],"highly":[67],"nontrivial.":[68],"We":[69],"therefore":[71],"reasonable":[74],"complexity":[75],"well":[78],"better":[80],"techniques":[81],"proving":[83],"decidability.":[84]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}