• Corpus ID: 4992977

Loop Restricted Existential Rules and First-order Rewritability for Query Answering

@inproceedings{Asuncion2018LoopRE,
  title={Loop Restricted Existential Rules and First-order Rewritability for Query Answering},
  author={Vernon Asuncion and Yan Zhang and Heng Zhang},
  booktitle={International Conference on Principles of Knowledge Representation and Reasoning},
  year={2018}
}
In ontology-based data access (OBDA), the classical database is enhanced with an ontology in the form of logical assertions generating new intensional knowledge. A powerful form of such logical assertions is the tuple-generating dependencies (TGDs), also called existential rules, where Horn rules are extended by allowing existential quantifiers to appear in the rule heads. In this paper we introduce a new language called loop restricted (LR) TGDs (existential rules), which are TGDs with certain… 

References

SHOWING 1-10 OF 34 REFERENCES

Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies

The results suggest that principled development of materialisation-based OWL 2 reasoners is practically feasible, and show that query answering for acyclic ontologies is of lower complexity than for general ontologies.

Extending Decidable Existential Rules by Joining Acyclicity and Guardedness

This paper provides complexity-preserving generalisations of weakly acyclic and weakly (frontier-) guarded rules, and a novel formalism of glut-frontier- guarded rules that subsumes both.

A general datalog-based framework for tractable query answering over ontologies

It is shown in particular that Datalog+/- generalizes the DL-Lite family of tractable description logics, which are the most common tractable ontology languages in the context of the Semantic Web and databases.

A Broad Class of First-Order Rewritable Tuple-Generating Dependencies

The class of weakly recursive TGDs is defined, and it is proved that this class comprises and generalizes every previously known FOL-rewritable class of TGDs, under fairly general assumptions on the form of the TGDs.

Combining decidability paradigms for existential rules

A powerful and flexible condition, called tameness, is proposed, which allows us to consolidate in an elegant and uniform way guardedness with stickiness.

Query and Predicate Emptiness in Ontology-Based Data Access

This paper determines the computational complexity of query emptiness and predicate emptiness in the EL, DL-Lite, and ALC-families of description logics, investigates the connection to ontology modules, and performs a practical case study to evaluate the new reasoning services.

Computing Datalog Rewritings for Disjunctive Datalog Programs and Description Logic Ontologies

This work proposes the class of markable disjunctive datalog programs, which is efficiently recognisable and admits polynomial rewritings into datalog, and proposes a second class of \(\mathcal{SHI}\) ontologies that admits exponential datalog rewriting via resolution.