{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T04:12:57Z","timestamp":1730002377609,"version":"3.28.0"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p>We present a novel approach to querying classical inconsistent description logic (DL) knowledge bases by adopting a paraconsistent semantics with the four \u2018Belnapian\u2019 values: exactly true (T), exactly false (F), both (B), and neither (N). In contrast to prior studies on paraconsistent DLs, we allow truth value operators in the query language, which can be used to differentiate between answers having contradictory evidence and those having only positive evidence. We present a reduction to classical DL query answering that allows us to pinpoint the precise combined and data complexity of answering queries with values in paraconsistent ALCHI and its sublogics. Notably, we show that tractable data complexity is retained for Horn DLs. We present a comparison with repair-based inconsistency-tolerant semantics, showing that the two approaches are incomparable.<\/jats:p>","DOI":"10.24963\/kr.2024\/14","type":"proceedings-article","created":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T06:30:28Z","timestamp":1729924228000},"page":"145-155","source":"Crossref","is-referenced-by-count":0,"title":["Queries With Exact Truth Values in Paraconsistent Description Logics"],"prefix":"10.24963","author":[{"given":"Meghyn","family":"Bienvenu","sequence":"first","affiliation":[{"name":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800"},{"name":"Japanese-French Laboratory for Informatics, CNRS, NII, IRL 2537"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camille","family":"Bourgaux","sequence":"additional","affiliation":[{"name":"DI ENS, ENS, CNRS, PSL University & Inria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniil","family":"Kozhemiachenko","sequence":"additional","affiliation":[{"name":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}","theme":"Artificial Intelligence","location":"Hanoi, Vietnam","acronym":"KR-2024","number":"21","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Academic College of Tel-Aviv","European Association for Artificial Intelligence","National Science Foundation"],"start":{"date-parts":[[2024,11,1]]},"end":{"date-parts":[[2024,11,8]]}},"container-title":["Proceedings of the TwentyFirst International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T06:30:31Z","timestamp":1729924231000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2024\/14"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2024\/14","relation":{},"subject":[],"published":{"date-parts":[[2024,11]]}}}