Set semantics for asynchronous TeamLTL: Expressivity and complexity

IF 0.8 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 2025-03-27 DOI:10.1016/j.ic.2025.105299

Juha Kontinen , Max Sandström , Jonni Virtema

引用次数: 0

Abstract

We introduce and develop a set-based semantics for asynchronous TeamLTL. We consider two canonical logics in this setting: the extensions of TeamLTL by the Boolean disjunction and by the Boolean negation. We relate the new semantics with the original semantics based on multisets and establish one of the first positive complexity theoretic results in the temporal team semantics setting. In particular we show that both logics enjoy normal forms that can be utilised to obtain results related to expressivity and complexity (decidability) of the new logics.

查看原文本刊更多论文

为异步TeamLTL设置语义：表现力和复杂性

我们为异步TeamLTL引入并开发了一种基于集合的语义。我们在此设置中考虑两种规范逻辑：通过布尔析取和布尔否定对TeamLTL进行扩展。我们将新语义与基于多集的原始语义联系起来，并在时间团队语义设置中建立了第一个肯定的复杂性理论结果。特别地，我们表明这两种逻辑都具有可用于获得与新逻辑的表达性和复杂性（可判决性）相关的结果的正规形式。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information and Computation 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking