资源论文Polynomial Rewritings for Linear Existential Rules

Polynomial Rewritings for Linear Existential Rules

2019-11-19 | |  61 |   39 |   0
Abstract We consider the scenario of ontology-based query answering. It is generally accepted that true scalability in this setting can only be achieved via query rewriting, which in turn allows for the exploitation of standard RDBMSs. In this work, we close two open fundamental questions related to query rewriting. We establish that linear existential rules are polynomially combined rewritable, while full linear rules are polynomially (purely) rewritable; in both cases, the target query language consists of first-order or non-recursive Datalog queries. An immediate consequence of our results is that DLRLiteR , the extension of DL-LiteR with n-ary roles, is polynomially combined rewritable.

上一篇:Computing Social Behaviours Using Agent Models

下一篇:Beyond SPARQL under OWL 2 QL Entailment Regime: Rules to the Rescue

用户评价
全部评价

热门资源

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • dynamical system ...

    allows to preform manipulations of heavy or bul...

  • The Variational S...

    Unlike traditional images which do not offer in...