资源分类
》 资源 》论文》Extending Decidable Cases for Rules with Existential Variables

Extending Decidable Cases for Rules with Existential Variables

2019-11-15 | |  75 |   37 |   0

Abstract In ∀∃-rules, the conclusion may contain existentially quantifified variables, which makes reasoning tasks (as deduction) non-decidable. These rules have the same logical form as TGD (tuplegenerating dependencies) in databases and as conceptual graph rules. We extend known decidable cases by combining backward and forward chaining schemes, in association with a graph that captures exactly the notion of dependency between rules. Finally, we draw a map of known decidable cases, including an extension obtained by combining our approach with very recent results on TGD

上一篇：Repairing Preference-Based Argumentation Frameworks

下一篇：An Argumentation-Based Interpreter for Golog Programs

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • 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...