Complexity of propositional logics in team semantic

DOI10.1145/3157054MaRDI QIDQ4608724zbMATH OpenOpenAlexWikidataFDO

Authors Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer

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

zbMATH Keywords

dependenceinclusionindependencemodel checkingpropositional logicsatisfiabilityteam semanticsvalidity

Mathematics Subject Classification ID

Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Decidability of predicate logics with team semantics
• Propositional team logics
• On the complexity of team logic and its two-variable fragment
• Complexity thresholds in inclusion logic
• Model checking and validity in propositional and modal inclusion logics

Cited in

(31)

• Propositional union closed team logics
• A parameterized view on the complexity of dependence logic
• Enumerating teams in first-order team logics
• On the complexity of linear temporal logic with team semantics
• On the computational consequences of independence in propositional logic
• Decidability of predicate logics with team semantics
• Team semantics for the specification and verification of hyperproperties
• On the complexity of team logic and its two-variable fragment
• Tractability frontier of data complexity in team semantics
• On quantified propositional logics and the exponential time hierarchy
• Tractability Frontier of Data Complexity in Team Semantics
• Canonical models and the complexity of modal team logic
• Counting of Teams in First-Order Team Logics
• Model checking and validity in propositional and modal inclusion logics
• Polyteam semantics
• Model checking and validity in propositional and modal inclusion logics
• On the succinctness of atoms of dependency
• Propositional team logics
• scientific article; zbMATH DE number 7056226 (Why is no real title available?)
• scientific article; zbMATH DE number 7056228 (Why is no real title available?)
• On Composing Finite Forests with Modal Logics
• Parameterised complexity of model checking and satisfiability in propositional dependence logic
• Complexity thresholds in inclusion logic
• Complexity thresholds in inclusion logic
• COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
• Modal logics and local quantifiers: a zoo in the elementary hierarchy
• Parameterized complexity of propositional inclusion and independence logic
• Logics with probabilistic team semantics and the Boolean negation
• Parameterized complexity of weighted team definability
• Logics with probabilistic team semantics and the Boolean negation
• Set semantics for asynchronous TeamLTL: expressivity and complexity

This page was built for publication: Complexity of propositional logics in team semantic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608724)