Absorption for ABoxes with Local Universal Restrictions

Inst C (Laptop Model, Portable Category) Inst C (Desktop Model, Non Portable Category) Inst R (ko94-po1, Alienware, has model) Inst R (jh56i-09, iMac, has model) Isa C

We establish tight complexity bounds for answering an extension of conjunctive 2-way regular path queries over EL and DL-Lite knowledge bases..

In particular, we show how instance checking tasks in this dialect can map to concept satis- faction problems in the dialect ALCIOQ(D), but where binary absorption in combination

In recent years, there has been growing interest in ontology-based data access, in which information in the ontology is used to derive additional answers to queries posed over

Also, we present polynomial time algorithms for the evolution of the instance level knowledge bases expressed in DL-Lite A,id , which the most expressive Description Logics of

Thus, we examined formula-based approaches and proposed two novel semantics for ABox updates, called Naive Semantics and Careful Semantics, which are closed for DL-Lite.. For both,

We adapt the techniques of model-based revision in propositional logic to the revision of DL-Lite bool KBs, and define a specific revision operator based on the distance

Operators in the query plan tree leaves corresponding to keywords in the query will simply read an inverted file for this word and return tuples consisting of