CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A Portrait of the Semantic Web in Action
IEEE Intelligent Systems
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Logical foundations of peer-to-peer data integration
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theory of Computation (Texts in Computer Science)
Theory of Computation (Texts in Computer Science)
Queries and updates in the coDB peer to peer database system
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Characterizing data complexity for conjunctive query answering in expressive description logics
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A Concise Introduction to Mathematical Logic
A Concise Introduction to Mathematical Logic
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Data-complexity of the two-variable fragment with counting quantifiers
Information and Computation
A general datalog-based framework for tractable query answering over ontologies
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Formal Properties of Modularisation
Modular Ontologies
Foundations of Temporal Conceptual Data Models
Conceptual Modeling: Foundations and Applications
Minimal module extraction from DL-lite ontologies using QBF solvers
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The DL-lite family and relations
Journal of Artificial Intelligence Research
Data complexity in the ƐL family of description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Reasoning over extended ER models
ER'07 Proceedings of the 26th international conference on Conceptual modeling
DL-Lite with temporalised concepts, rigid axioms and roles
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
Forgetting for knowledge bases in DL-Lite
Annals of Mathematics and Artificial Intelligence
Generalized satisfiability for the description logic ALC
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Tailoring temporal description logics for reasoning over temporal conceptual models
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
OntoRevision: a plug-in system for ontology revision in protégé
JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web
Probabilistic reasoning in DL-lite
PRICAI'12 Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence
Generalized satisfiability for the description logic ALC
Theoretical Computer Science
Hi-index | 0.00 |
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large amounts of data, is posing challenging requirements w.r.t. a trade-off between expressive power of a DL and efficiency of reasoning. The logics of the DL-Lite family were specifically designed to meet such requirements and optimized w.r.t. the data complexity of answering complex types of queries. In this paper we propose DL-Litebool, an extension of DL-Lite with full Booleans and number restrictions, and study the complexity of reasoning in DL-Litebool and its significant sub-logics. We obtain our results, together with useful insights into the properties of the studied logics, by a novel reduction to the one-variable fragment of first-order logic. We study the computational complexity of satisfiability and subsumption, and the data complexity of answering positive existential queries (which extend unions of conjunctive queries). Notably, we extend the LOGSPACE upper bound for the data complexity of answering unions of conjunctive queries in DL-Lite to positive queries and to the possibility of expressing also number restrictions, and hence local functionality in the TBox.