资源分类
》 资源 》论文》Restricted Chase (Non)Termination for Existential Rules with Disjunctions

Restricted Chase (Non)Termination for Existential Rules with Disjunctions

2019-10-29 | |  45 |   45 |   0
Abstract The restricted chase is a sound and complete algorithm for conjunctive query answering over ontologies of disjunctive existential rules. We develop acyclicity conditions to ensure its termination. Our criteria cannot always detect termination (the problem is undecidable), and we develop the first cyclicity criteria to show non-termination of the restricted chase. Experiments on real-world ontologies show that our acyclicity notions improve significantly over known criteria

上一篇：Rescale-Invariant SVM for Binary Classification

下一篇：Social Pressure in Opinion Games

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Learning to learn...

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