Modular SAT-based techniques for reasoning tasks in team semantics

04/01/2022
by   Arnaud Durand, et al.
0

We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems. Our approach is based on modular reductions of these problems into the corresponding problems of various classes of Boolean formulas. We illustrate our approach via several new tractability/intractability results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2023

Logics with probabilistic team semantics and the Boolean negation

We study the expressivity and the complexity of various logics in probab...
research
10/07/2020

Linear-time Temporal Logic with Team Semantics: Expressivity and Complexity

We study the expressivity and the model checking problem of linear tempo...
research
04/21/2023

Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity

We introduce and develop a set-based semantics for asynchronous TeamLTL....
research
02/01/2023

Parameterized Complexity of Weighted Team Definability

In this article, we study the complexity of weighted team definability f...
research
04/09/2021

On elementary logics for quantitative dependencies

We define and study logics in the framework of probabilistic team semant...
research
09/25/2017

Team Semantics for the Specification and Verification of Hyperproperties

We develop team semantics for Linear Temporal Logic (LTL) to express hyp...
research
04/05/2023

Picturing counting reductions with the ZH-calculus

Counting the solutions to Boolean formulae defines the problem #SAT, whi...

Please sign up or login with your details

Forgot password? Click here to reset