Deciding FO-Rewritability in EL

Here, we give a characterization of model-conservative ALC rewritability of ALCI TBoxes in terms of generated subinterpretations and use it to show that (i)

Keywords: description logics, formal concept analysis, base of GCIs, implica- tional base, TBox extension, incremental learning..

In Section 3, we discuss how the logical difference problem for EL -terminologies could be extended to general EL -TBoxes, and we establish a witness theorem for general EL -TBoxes..

(i) approaches that target rewritings in the more expressive query language dat- alog which are incomplete in the sense that the generated datalog-rewritings are not guaranteed to

We present three main results: (1) TBoxes formulated in the extension of DL-Lite core with ELI-concepts on the right-hand side of concept inclusions can be learned in polynomial

There we show that the characterization can be used to verify whether a given common subsumer is indeed the least one and show that the size of the lcs, if it exists, is

In addition, an enriched model stores a map from normal to the original axioms to allow for checking the entailment of concept inclusions from different subsets of the input TBox..

For example, a ground subsumption, as considered in the Eager Ground Solving rule, either follows from the TBox, in which case any substitution solves it, or it does not, in which