Polynomial Rewritings from Expressive Description Logics with Closed Predicates to Variants of Datalog

@article{Ahmetaj2020PolynomialRF,
  title={Polynomial Rewritings from Expressive Description Logics with Closed Predicates to Variants of Datalog},
  author={Shqiponja Ahmetaj and Magdalena Ortiz and M. Simkus},
  journal={ArXiv},
  year={2020},
  volume={abs/1912.07475}
}
Abstract In many scenarios, complete and incomplete information coexist. For this reason, the knowledge representation and database communities have long shown interest in simultaneously supporting the closed- and the open-world views when reasoning about logic theories. Here we consider the setting of querying possibly incomplete data using logic theories, formalized as the evaluation of an ontology-mediated query (OMQ) that pairs a query with a theory, sometimes called an ontology, expressing… Expand
Rewriting Approaches for Ontology-Mediated Query Answering
Ontologies and Data Management: A Brief Survey
Rewritability Results for OMQs with Closed Predicates

References

SHOWING 1-10 OF 53 REFERENCES
Polynomial Disjunctive Datalog Rewritings of Instance Queries in Expressive Description Logics
Closed Predicates in Description Logics: Results on Combined Complexity
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Ontology-Based Data Access with Closed Predicates is Inherently Intractable(Sometimes)
Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates
Data Complexity of Query Answering in Description Logics
Ontology-Mediated Query Answering with Data-Tractable Description Logics
Effective query rewriting with ontologies over DBoxes
A general datalog-based framework for tractable query answering over ontologies
Answering regular path queries in expressive Description Logics via alternating tree-automata
...
1
2
3
4
5
...