Complexity of Propositional Logics in Team Semantic
From MaRDI portal
Publication:4608724
DOI10.1145/3157054zbMath1407.68291OpenAlexW2964051209MaRDI QIDQ4608724
Juha Kontinen, Heribert Vollmer, Miika Hannula, Jonni Virtema
Publication date: 22 March 2018
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10138/233124
independencepropositional logicvaliditymodel checkingsatisfiabilitydependenceteam semanticsinclusion
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (13)
On Composing Finite Forests with Modal Logics ⋮ A parameterized view on the complexity of dependence logic ⋮ Enumerating teams in first-order team logics ⋮ Unnamed Item ⋮ Modal logics and local quantifiers: a zoo in the elementary hierarchy ⋮ Parameterized complexity of propositional inclusion and independence logic ⋮ Team semantics for the specification and verification of hyperproperties ⋮ On the complexity of team logic and its two-variable fragment ⋮ Parameterised complexity of model checking and satisfiability in propositional dependence logic ⋮ Canonical Models and the Complexity of Modal Team Logic ⋮ Unnamed Item ⋮ Complexity thresholds in inclusion logic ⋮ Model Checking and Validity in Propositional and Modal Inclusion Logics
This page was built for publication: Complexity of Propositional Logics in Team Semantic
