{"id":"https://openalex.org/W2947136671","doi":"https://doi.org/10.1109/lics.2019.8785823","title":"When is Ontology-Mediated Querying Efficient?","display_name":"When is Ontology-Mediated Querying Efficient?","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2947136671","doi":"https://doi.org/10.1109/lics.2019.8785823","mag":"2947136671"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/0b819eb3-d9f5-4dad-a700-d349bf717c0d","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051683347","display_name":"Pablo Barcel\u00f3","orcid":"https://orcid.org/0000-0003-2293-2653"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pablo Barcelo","raw_affiliation_strings":["DCC, U of Chile & IMFD, Chile"],"affiliations":[{"raw_affiliation_string":"DCC, U of Chile & IMFD, Chile","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055516926","display_name":"Cristina Feier","orcid":null},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Cristina Feier","raw_affiliation_strings":["University of Bremen"],"affiliations":[{"raw_affiliation_string":"University of Bremen","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034616829","display_name":"Carsten Lutz","orcid":"https://orcid.org/0000-0002-8791-6702"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Carsten Lutz","raw_affiliation_strings":["University of Bremen"],"affiliations":[{"raw_affiliation_string":"University of Bremen","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067962748","display_name":"Andr\u00e9as Pieris","orcid":"https://orcid.org/0000-0003-4779-3469"},"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":"Andreas Pieris","raw_affiliation_strings":["University of Edinburgh"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5051683347"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1561,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84105382,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"4790","issue":null,"first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9998000264167786,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991999864578247,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9976999759674072,"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/conjunctive-query","display_name":"Conjunctive query","score":0.7219786643981934},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.686769425868988},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6719645261764526},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.655661404132843},{"id":"https://openalex.org/keywords/ontology","display_name":"Ontology","score":0.6487484574317932},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.5809950232505798},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5294221043586731},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.49051398038864136},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4660317301750183},{"id":"https://openalex.org/keywords/boolean-conjunctive-query","display_name":"Boolean conjunctive query","score":0.4273143410682678},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4223845899105072},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4170333743095398},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3422558903694153},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.30262529850006104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24753576517105103},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23019447922706604},{"id":"https://openalex.org/keywords/web-query-classification","display_name":"Web query classification","score":0.0864737331867218}],"concepts":[{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.7219786643981934},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.686769425868988},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6719645261764526},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.655661404132843},{"id":"https://openalex.org/C25810664","wikidata":"https://www.wikidata.org/wiki/Q44325","display_name":"Ontology","level":2,"score":0.6487484574317932},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.5809950232505798},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5294221043586731},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.49051398038864136},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4660317301750183},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.4273143410682678},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4223845899105072},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4170333743095398},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3422558903694153},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.30262529850006104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24753576517105103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23019447922706604},{"id":"https://openalex.org/C118689300","wikidata":"https://www.wikidata.org/wiki/Q7978614","display_name":"Web query classification","level":4,"score":0.0864737331867218},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/lics.2019.8785823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/0b819eb3-d9f5-4dad-a700-d349bf717c0d","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/0b819eb3-d9f5-4dad-a700-d349bf717c0d","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Barcel\u00f3, P, Feier, C, Lutz, C & Pieris, A 2019, When is Ontology-Mediated Querying Efficient? in Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers, pp. 1-13, Thirty-Fourth Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, Canada, 24/06/19. https://doi.org/10.1109/LICS.2019.8785823","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/0b819eb3-d9f5-4dad-a700-d349bf717c0d","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/document/8785823","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":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/0b819eb3-d9f5-4dad-a700-d349bf717c0d","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/0b819eb3-d9f5-4dad-a700-d349bf717c0d","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Barcel\u00f3, P, Feier, C, Lutz, C & Pieris, A 2019, When is Ontology-Mediated Querying Efficient? in Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers, pp. 1-13, Thirty-Fourth Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, Canada, 24/06/19. https://doi.org/10.1109/LICS.2019.8785823","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W5051221","https://openalex.org/W36639738","https://openalex.org/W187851124","https://openalex.org/W655258421","https://openalex.org/W1483388050","https://openalex.org/W1492384575","https://openalex.org/W1510716341","https://openalex.org/W1528446492","https://openalex.org/W1564178427","https://openalex.org/W1565047086","https://openalex.org/W1583242661","https://openalex.org/W1589560471","https://openalex.org/W1622055787","https://openalex.org/W1667574996","https://openalex.org/W1868489877","https://openalex.org/W1975733288","https://openalex.org/W1985581502","https://openalex.org/W2048685245","https://openalex.org/W2056660085","https://openalex.org/W2057826895","https://openalex.org/W2061513598","https://openalex.org/W2099367286","https://openalex.org/W2104356397","https://openalex.org/W2107910552","https://openalex.org/W2111829945","https://openalex.org/W2118076394","https://openalex.org/W2137862151","https://openalex.org/W2140302114","https://openalex.org/W2157027735","https://openalex.org/W2199172455","https://openalex.org/W2270170253","https://openalex.org/W2278206731","https://openalex.org/W2347154127","https://openalex.org/W2490706771","https://openalex.org/W2531240070","https://openalex.org/W2572335555","https://openalex.org/W2572523339","https://openalex.org/W2572885380","https://openalex.org/W2578515325","https://openalex.org/W2588857520","https://openalex.org/W2763521382","https://openalex.org/W2963526549","https://openalex.org/W3101483322","https://openalex.org/W4206031975","https://openalex.org/W4244275182","https://openalex.org/W4285719527","https://openalex.org/W6600191388","https://openalex.org/W6629408520","https://openalex.org/W6630608873","https://openalex.org/W6633933107","https://openalex.org/W6633989784","https://openalex.org/W6636431354","https://openalex.org/W6639181261","https://openalex.org/W6675231068","https://openalex.org/W6680758529","https://openalex.org/W6687817163","https://openalex.org/W6694822605","https://openalex.org/W6731443070","https://openalex.org/W6731870065"],"related_works":["https://openalex.org/W1491404282","https://openalex.org/W2396140825","https://openalex.org/W3021846193","https://openalex.org/W2197207463","https://openalex.org/W1481314305","https://openalex.org/W1561400777","https://openalex.org/W2139894293","https://openalex.org/W1855322793","https://openalex.org/W2963364464","https://openalex.org/W2551830925"],"abstract_inverted_index":{"In":[0],"ontology-mediated":[1,28,66],"querying,":[2],"description":[3],"logic":[4],"(DL)":[5],"ontologies":[6],"are":[7,99,127,134,156],"used":[8],"to":[9,22,139,160,191,206],"enrich":[10],"incomplete":[11],"data":[12],"with":[13],"domain":[14],"knowledge":[15],"which":[16,110],"results":[17,133,201],"in":[18,46,52,129,135,158],"more":[19],"complete":[20],"answers":[21],"queries.":[23,84],"However,":[24],"the":[25,39,47,82,86,94,112,122,165,177,180,210,216],"evaluation":[26,43],"of":[27,49,65,78,93,96,114,121,124,137,141,164,168,179,183,194,219],"queries":[29,80,170],"(OMQs)":[30],"over":[31,171],"relational":[32,172],"databases":[33],"is":[34,44,189],"computationally":[35],"hard.":[36],"This":[37],"raises":[38],"question":[40,61],"when":[41],"OMQ":[42,188,193],"efficient,":[45],"sense":[48],"being":[50],"tractable":[51,128,166],"combined":[53,130],"complexity":[54,153,178],"or":[55],"fixed-parameter":[56,100],"tractable.":[57,101],"We":[58,174,213],"study":[59,176],"this":[60],"for":[62],"a":[63,91,119,148,186],"range":[64,203],"query":[67],"languages":[68],"based":[69],"on":[70,147,209],"several":[71,199],"important":[72],"and":[73,145],"widely-used":[74],"DLs,":[75,220],"using":[76],"unions":[77],"conjunctive":[79,169],"as":[81],"actual":[83],"For":[85,102],"DL":[87,211],"ELHI\u22a5,":[88],"we":[89,117],"provide":[90,118],"characterization":[92,120,163],"classes":[95,123,167],"OMQs":[97,125,140],"that":[98,126,202],"its":[103],"fragment":[104],"ELH\u22a5":[105],"<sup":[106],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[107,227],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">dr</sup>":[108],",":[109,229],"restricts":[111],"use":[113],"inverse":[115],"roles,":[116],"complexity.":[131],"Both":[132],"terms":[136],"equivalence":[138],"bounded":[142,195],"tree":[143,196],"width":[144],"rest":[146],"reasonable":[149],"assumption":[150],"from":[151,204],"parameterized":[152],"theory.":[154],"They":[155],"similar":[157],"spirit":[159],"Grohe's":[161],"seminal":[162],"databases.":[173],"further":[175],"meta":[181],"problem":[182],"deciding":[184],"whether":[185],"given":[187],"equivalent":[190],"an":[192],"width,":[197],"providing":[198],"completeness":[200],"NP":[205],"2ExpTIME,":[207],"depending":[208],"used.":[212],"also":[214],"consider":[215],"DL-Lite":[217],"family":[218],"including":[221],"members":[222],"that,":[223],"unlike":[224],"\u03b5LHI":[225],"<sub":[226],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u22a5</sub>":[228],"admit":[230],"functional":[231],"roles.":[232]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}