资源论文Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying

Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying

2019-11-05 | |  81 |   46 |   0
Abstract In ontology-mediated querying with an expressive description logic (DL) L, two desirable properties of a TBox T are (1) being able to replace T with a TBox formulated in the Horn-fragment of L without affecting the answers to conjunctive queries (CQs) and (2) that every CQ can be evaluated in PT IME w.r.t. T . We investigate in which cases (1) and (2) are equivalent, finding that the answer depends on whether the unique name assumption (UNA) is made, on the DL under consideration, and on the nesting depth of quantifiers in the TBox. We also clarify the relation between query evaluation with and without UNA and consider natural variations of property (1).

上一篇:Two Sides of the Same Coin: Belief Revision and Enforcing Arguments?

下一篇:On the Conditional Logic of Simulation Models

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...