On the succinctness of query rewriting over shallow ontologies
We investigate the size of first-order rewritings of conjunctive queries overOWL 2 QLontologies ofdepth 1 and 2 by means of hypergraph programs computing Boolean functions. Both positive and neg-ative results are obtained. Conjunctive queries over ontologies of depth 1 have polynomial-size nonre-c...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | https://repository.londonmet.ac.uk/5791/1/1401.4420.pdf |