Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
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
Query rewriting and answering under constraints in data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Query answering under non-guarded rules in datalog+/-
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Advanced processing for ontological queries
Proceedings of the VLDB Endowment
On rules with existential variables: Walking the decidability line
Artificial Intelligence
Ontological queries: Rewriting and optimization
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
The MASTRO system for ontology-based data access
Semantic Web
Ontological query answering via rewriting
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
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
Extending decidable existential rules by joining acyclicity and guardedness
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Research summary: datalog-based data access
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We study reasoning, and in particular query answering, over databases with tuple-generating dependencies (TGDs). Our focus is on classes of TGDs for which conjunctive query answering is first-order rewritable, i.e., can be reduced to the standard evaluation of a first-order query over the database. In this paper, we define the class of weakly recursive TGDs, and prove that this class comprises and generalizes every previously known FOL-rewritable class of TGDs, under fairly general assumptions on the form of the TGDs.