Complexity of Propositional Logics in Team Semantic-Reference-Cited by-同舟云学术

Complexity of Propositional Logics in Team Semantic

Published:2018-02-15 Issue:1 Volume:19 Page:1-14
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Hannula Miika¹,Kontinen Juha¹,Virtema Jonni²,Vollmer Heribert²

Affiliation:

1. University of Helsinki, Helsinki, Finland

2. Leibniz Universität Hannover and University of Helsinki, Helsinki, Finland

Abstract

We classify the computational complexity of the satisfiability, validity, and model-checking problems for propositional independence, inclusion, and team logic. Our main result shows that the satisfiability and validity problems for propositional team logic are complete for alternating exponential-time with polynomially many alternations.

Funder

Jenny and Antti Wihuri Foundation

DAAD

Academy of Finland

Publisher

Association for Computing Machinery (ACM)

Subject

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

Link

https://dl.acm.org/doi/pdf/10.1145/3157054

Reference33 articles.

1. Relational Hidden Variables and Non-Locality

2. From IF to BI

3. The Boolean formula value problem is in ALOGTIME

4. Alternation

5. The complexity of theorem-proving procedures

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

1. Parameterized complexity of weighted team definability;Mathematical Structures in Computer Science;2024-02-20

2. On Composing Finite Forests with Modal Logics;ACM Transactions on Computational Logic;2023-04-03

3. Logics with Probabilistic Team Semantics and the Boolean Negation;Logics in Artificial Intelligence;2023

4. Parameterized Complexity of Propositional Inclusion and Independence Logic;Logic, Language, Information, and Computation;2023

5. Enumerating teams in first-order team logics;Annals of Pure and Applied Logic;2022-12