Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity
We give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language OWL 2 QL: the succinctness problem for first-order rewritings of ontology-mediated queries (OMQs) and the complexity problem for OMQ answering. We classify OMQs according...
| Κύριοι συγγραφείς: | , , , , |
|---|---|
| Μορφή: | Journal article |
| Έκδοση: |
Association for Computing Machinery
2018
|