资源分类
》 资源 》》On the Boundary of (Un)decidability: Decidable Model-Checking for a Fragment of Resource Agent Logic?

On the Boundary of (Un)decidability: Decidable Model-Checking for a Fragment of Resource Agent Logic?

2019-11-18 | |  47 |   1 |   0
Abstract The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (un)decidability results and identify a significant fragment of the logic for which model checking is decidable. We discuss aspects which makes model checking decidable and prove undecidability of two open fragments over a class of models in which agents always have a choice of doing nothing.

上一篇：Cost-Optimal and Net-Benefit Planning — A Parameterised Complexity View?

下一篇：Further Connections Between Contract-Scheduling and Ray-Searching Problems?

用户评价
全部评价

热门资源

  • Unsupervised Pivo...

    Unsupervised neural machine translation (NMT) h...

  • Style Transformer...

    Disentangling the content and style in the lat...

  • Transferable Mult...

    Over-dependence on domain ontology and lack of ...

  • On the Word Align...

    Prior researches suggest that neural machine tr...

  • Soft Contextual D...

    While data augmentation is an important trick t...