Horn rewritability vs PTime query evaluation for description logic TBoxes


Hernich, A, Lutz, C, Papacchini, F ORCID: 0000-0002-0310-7378 and Wolter, F (2018) Horn rewritability vs PTime query evaluation for description logic TBoxes. .

Access the full-text of this item by clicking on the Open Access link.
[img] Text
dl17full.pdf - Published version
Download (334kB)

Abstract

We study the following question: if τ is a TBox that is formulated in an expressive DL L and all CQs can be evaluated in PTime w.r.t. τ, can τ be replaced by a TBox τ' that is formulated in the Horn-fragment of L and such that for all CQs and ABoxes, the answers w.r.t. τ and τ' coincide? Our main results are that this is indeed the case when L is the set of ALCHI or ALCIF TBoxes of quantifier depth 1 (which covers the majority of such TBoxes), but not for ALCHIF and ALCQ TBoxes of depth 1.

Item Type: Conference or Workshop Item (Unspecified)
Depositing User: Symplectic Admin
Date Deposited: 11 Sep 2017 09:43
Last Modified: 19 Jan 2023 06:55
Open Access URL: https://www.ijcai.org/proceedings/2018/0257.pdf
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3009359
CORE (COnnecting REpositories)