资源分类
》 资源 》论文》Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates

Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates

2019-11-25 | |  87 |   40 |   0
Abstract We consider instance queries mediated by an ontology expressed in the expressive DL ALCHIO with closed predicates. We observe that such queries are non-monotonic and cannot be expressed in monotonic variants of DATALOG, but a polynomial time translation into disjunctive DATALOG extended with negation as failure is feasible. If no closed predicates are present–in the case of classical instance checking in ALCHIO–our translation yields a positive disjunctive DATALOG program of polynomial size. To the best of our knowledge, this is the first polynomial time translation of an expressive (non-Horn) DL into disjunctive DATALOG.

上一篇：Planning with Task-Oriented Knowledge Acquisition for a Service Robot

下一篇：Evaluation of Arguments from Support Relations: Axioms and Semantics

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...