Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
IEEE Intelligent Systems
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Conjunctive query answering for the description logic SHIQ
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The complexity of finite model reasoning in description logics
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Explanation in the DL-Lite Family of Description Logics
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
Reducing multiplicities in class diagrams
Proceedings of the 14th international conference on Model driven engineering languages and systems
A logical toolbox for ontological reasoning
ACM SIGMOD Record
Datalog+/-: a family of languages for ontology querying
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Computing universal models under guarded TGDs
Proceedings of the 15th International Conference on Database Theory
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Hi-index | 0.00 |
The semantics of OWL-DL and its subclasses are based on the classical semantics of first-order logic, in which the interpretation domain may be an infinite set. This constitutes a serious expressive limitation for such ontology languages, since, in many real application scenarios for the Semantic Web, the domain of interest is actually finite, although the exact cardinality of the domain is unknown. Hence, in these cases the formal semantics of the OWL-DL ontology does not coincide with its intended semantics. In this paper we start filling this gap, by considering the subclasses of OWL-DL which correspond to the logics of the DL-Lite family, and studying reasoning over finite models in such logics. In particular, we mainly consider two reasoning problems: deciding satisfiability of an ontology, and answering unions of conjunctive queries (UCQs) over an ontology. We first consider the description logic DL-LiteR and show that, for the two above mentioned problems, finite model reasoning coincides with classical reasoning, i.e., reasoning over arbitrary, unrestricted models. Then, we analyze the description logics DL-LiteF and DL-LiteA. Differently from DL-LiteR, in suchlogics finite model reasoning does not coincide with classical reasoning. To solve satisfiability and query answering over finite models in these logics, we define techniques which reduce polynomially both the above reasoning problems over finite models to the corresponding problem over arbitrary models. Thus, for all the DL-Lite languages considered, the good computational properties of satisfiability and query answering under the classical semantics also hold under the finite model semantics. Moreover, we have effectively and easily implemented the above techniques, extending the DL-Lite reasoner QuOnto with support for finite model reasoning.