The implication problem for functional and inclusion dependencies
Information and Control
A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Logic programming and databases
Logic programming and databases
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
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
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The Lixto data extraction project: back and forth between theory and practice
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Position paper: a comparison of two modelling paradigms in the Semantic Web
Proceedings of the 15th international conference on World Wide Web
Containment of conjunctive object meta-queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Logical foundations of (e)RDF(S): complexity and reasoning
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Journal on data semantics X
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
On chase termination beyond stratification
Proceedings of the VLDB Endowment
Enabling ontology evolution in data integration
Proceedings of the 2010 EDBT/ICDT Workshops
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Query answering under non-guarded rules in datalog+/-
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
On the semantic relationship between datalog and description logics
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
ACM Transactions on Computational Logic (TOCL)
DES: A Deductive Database System
Electronic Notes in Theoretical Computer Science (ENTCS)
Incomplete information and certain answers in general data models
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ontology evolution in data integration: query rewriting to the rescue
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Semantic Web search based on ontological conjunctive queries
Web Semantics: Science, Services and Agents on the World Wide Web
A deductive database with datalog and SQL query languages
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Datalog-Related aspects in lixto visual developer
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Datalog+/-: a family of languages for ontology querying
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Outer Joins in a Deductive Database System
Electronic Notes in Theoretical Computer Science (ENTCS)
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
A Generalized QSQR Evaluation Method for Horn Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
Ontology-based semantic search on the Web and its combination with the power of inductive reasoning
Annals of Mathematics and Artificial Intelligence
Ontology evolution without tears
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
We report on a recently introduced family of expressive extensions of Datalog, called Datalog±, which is a new framework for representing ontological axioms in form of integrity constraints, and for query answering under such constraints. Datalog± is derived from Datalog by allowing existentially quantified variables in rule heads, and by enforcing suitable properties in rule bodies, to ensure decidable and efficient query answering. We first present different languages in the Datalog± family, providing tight complexity bounds for all cases but one (where we have a low complexity AC0 upper bound). We then show that such languages are general enough to capture the most common tractable ontology languages. In particular, we show that the DL-Lite family of description logics and F-Logic Lite are expressible in Datalog±. We finally show how stratified negation can be added to Datalog± while keeping ontology querying tractable in the data complexity. Datalog± is a natural and very general framework that can be successfully employed in different contexts such as data integration and exchange. This survey mainly summarizes two recent papers.