{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:27:24Z","timestamp":1772242044493,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T00:00:00Z","timestamp":1510531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T00:00:00Z","timestamp":1510531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T00:00:00Z","timestamp":1510531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["647289"],"award-info":[{"award-number":["647289"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We analyze the data complexity of ontology-mediated querying where the ontologies are formulated in a description logic (DL) of the ALC family and queries are conjunctive queries, positive existential queries, or acyclic conjunctive queries. Our approach is non-uniform in the sense that we aim to understand the complexity of each single ontology instead of for all ontologies formulated in a certain language. While doing so, we quantify over the queries and are interested, for example, in the question whether all queries can be evaluated in polynomial time w.r.t. a given ontology. Our results include a PTime\/coNP-dichotomy for ontologies of depth one in the description logic ALCFI, the same dichotomy for ALC- and ALCI-ontologies of unrestricted depth, and the non-existence of such a dichotomy for ALCF-ontologies. For the latter DL, we additionally show that it is undecidable whether a given ontology admits PTime query evaluation. We also consider the connection between PTime query evaluation and rewritability into (monadic) Datalog.<\/jats:p>","DOI":"10.23638\/lmcs-13(4:7)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:28:42Z","timestamp":1743686922000},"source":"Crossref","is-referenced-by-count":1,"title":["The Data Complexity of Description Logic Ontologies"],"prefix":"10.23638","volume":"Volume 13, Issue 4","author":[{"given":"Carsten","family":"Lutz","sequence":"first","affiliation":[]},{"given":"Frank","family":"Wolter","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,11,13]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1611.02453v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1611.02453v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:28:42Z","timestamp":1743686922000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/2203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,13]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(4:7)2017","relation":{"has-preprint":[{"id-type":"arxiv","id":"1611.02453v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1611.02453v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1611.02453","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1611.02453","asserted-by":"subject"}],"is-cited-by":[{"id-type":"doi","id":"10.1007\/978-3-030-60067-9_5","asserted-by":"object"},{"id-type":"doi","id":"10.1007\/978-3-030-29193-8_6","asserted-by":"object"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,13]]},"article-number":"2203"}}