Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications

Authors:
Andrea Cali;Georg Gottlob;Thomas Lukasiewicz;Bruno Marnette;Andreas Pieris
Affiliations:
-;-;-;-;-
Venue:
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Year:
2010

Citing 0
Cited 23

On rules with existential variables: Walking the decidability line

Artificial Intelligence
Ontological query answering with existential rules

RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Towards farsighted dependencies for existential rules

RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Conjunctive query answering in probabilistic datalog+/- ontologies

RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Answering threshold queries in probabilistic datalog+/-ontologies

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Datalog+/-: a family of languages for ontology querying

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Uniform evaluation of nonmonotonic DL-Programs

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Querying UML class diagrams

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Walking the complexity lines for generalized guarded existential rules

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Modelling structured domains using description graphs and logic programming

ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
On the complexity of ontological reasoning under disjunctive existential rules

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Completeness guarantees for incomplete ontology reasoners: theory and practice

Journal of Artificial Intelligence Research
Query rewriting under ontology contraction

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Synthesis of the canonical models for database integration preserving semantics of the value inventive data models

ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Effective support of databases with ontological dependencies: Relational languages instead of description logics

Programming and Computing Software
Relational theories with null values and non-herbrand stable models

Theory and Practice of Logic Programming
Well-founded semantics for extended datalog and ontological reasoning

Proceedings of the 32nd symposium on Principles of database systems
Scalable containment for unions of conjunctive queries under constraints

Proceedings of the Fifth Workshop on Semantic Web Information Management
Semantic query optimization in the presence of types

Journal of Computer and System Sciences
Making the most of your triple store: query answering in OWL 2 using an RL reasoner

Proceedings of the 22nd international conference on World Wide Web
Acyclicity notions for existential rules and their application to query answering in ontologies

Journal of Artificial Intelligence Research
Query rewriting under query refinements

Knowledge-Based Systems
Query answering under probabilistic uncertainty in Datalog+ / - ontologies

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and for a variety of other applications. Datalog+/- extends plain Datalog by features such as existentially quantified rule heads and, at the same time, restricts the rule syntax so as to achieve decidability and tractability. In particular, we discuss three paradigms ensuring decidability: chase termination, guardedness, and stickiness.