资源分类
》 资源 》论文》An Epistemic Halpern–Shoham Logic

An Epistemic Halpern–Shoham Logic

2019-11-11 | |  62 |   45 |   0
Abstract We define a family of epistemic extensions of Halpern–Shoham logic for reasoning about temporal-epistemic properties of multi-agent systems. We exemplify their use and study the complexity of their model checking problem. We show a range of results ranging from PT IME to PS PACE– hard depending on the logic considered.

上一篇：Analogico-Deductive Generation of G ̈ odel’s First Incompleteness Theorem from the Liar Paradox

下一篇：Preference-Based Query Answering in Datalog+/– Ontologies Thomas Lukasiewicz Maria Vanina Martinez Gerardo I. Simari

用户评价
全部评价

热门资源

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