资源分类
》 资源 》论文》On the Undecidability of the Situation Calculus Extended with Description Logic Ontologies

On the Undecidability of the Situation Calculus Extended with Description Logic Ontologies

2019-11-19 | |  65 |   40 |   0
Abstract In this paper we investigate situation calculus action theories extended with ontologies, expressed as description logics TBoxes that act as state constraints. We show that this combination, while natural and desirable, is particularly problematic: it leads to undecidability of the simplest form of reasoning, namely satisfiability, even for the simplest kinds of description logics and the simplest kind of situation calculus action theories.

上一篇：Logic Program Termination Analysis Using Atom Sizes

下一篇：Verification of Generalized Inconsistency-Aware Knowledge and Action Bases

用户评价
全部评价

热门资源

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...