Good-for-Game QPTL: An Alternating Hodges Semantics

Author:

Bellier Dylan1ORCID,Benerecetti Massimo2ORCID,Monica Dario Della3ORCID,Mogavero Fabio2ORCID

Affiliation:

1. Université Rennes 1, Rennes, France

2. Università degli Studi di Napoli Federico II, Napoli, Italy

3. Università degli Studi di Udine, Udine, Italy

Abstract

An extension of QPTL is considered where functional dependencies among the quantified variables can be restricted in such a way that their current values are independent of the future values of the other variables. This restriction is tightly connected to the notion of behavioral strategies in game-theory and allows the resulting logic to naturally express game-theoretic concepts. Inspired by the work on logics of dependence and independence, we provide a new compositional semantics for QPTL that allows for expressing such functional dependencies among variables. The fragment where only restricted quantifications are considered, called behavioral quantifications , allows for linear-time properties that are satisfiable if and only if they are realisable in the Pnueli-Rosner sense. This fragment can be decided, for both model checking and satisfiability , in 2 Exp Time and is expressively equivalent to QPTL , though significantly less succinct.

Funder

GNCS 2020

Strategic Reasoning and Automatic Synthesis of Multi-Agent Systems

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Reference87 articles.

1. S. Abramsky, J. Kontinen, J. A. Väänänen, and H. Vollmer. 2016. Dependence Logic: Theory and Applications. Springer.

2. E. Acar, M. Benerecetti, and F. Mogavero. 2019. Satisfiability in strategy logic can be easier than model checking. In AAAI Press19. AAAI Press, 2638–2645.

3. M. Benerecetti, F. Mogavero, and A. Murano. 2013. Substructure temporal logic. In Logic in Computer Science’13. IEEE Computer Society, 368–377.

4. Reasoning about substructures and games;Benerecetti M.;Transactions on Computational Logic,2015

5. Henkin quantifiers and complete problems;Blass A.;Annals of Pure and Applied Logic,1986

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Alternating (In)Dependence-Friendly Logic;Annals of Pure and Applied Logic;2023-12

2. Behavioral QLTL;Multi-Agent Systems;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3