DeepAI AI Chat
Log In Sign Up

Complexity Thresholds in Inclusion Logic

by   Miika Hannula, et al.

Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in these logics are relatively well understood. Inclusion logic is similar to these team-based logical formalisms with the exception that it corresponds to deterministic polynomial time in ordered models. In this article we examine connections between syntactical fragments of inclusion logic and different complexity classes in terms of two computational problems: maximal subteam membership and the model checking problem for a fixed inclusion logic formula. We show that very simple quantifier-free formulae with one or two inclusion atoms generate instances of these problems that are complete for (non-deterministic) logarithmic space and polynomial time. Furthermore, we present a fragment of inclusion logic that captures non-deterministic logarithmic space in ordered models.


page 1

page 2

page 3

page 4


Parameterised Complexity of Propositional Logic in Team Semantics

In this work we analyse the parameterised complexity of propositional in...

Probabilistic Complexity Classes through Semantics

In a recent paper, the author has shown how Interaction Graphs models fo...

Enumerating Teams in First-Order Team Logics

We start the study of the enumeration complexity of different satisfiabi...

Polynomial-time probabilistic reasoning with partial observations via implicit learning in probability logics

Standard approaches to probabilistic reasoning require that one possesse...

Parameterized Complexity of Weighted Team Definability

In this article, we study the complexity of weighted team definability f...

Insignificant Choice Polynomial Time

In the late 1980s Gurevich conjectured that there is no logic capturing ...

On the Interaction of Functional and Inclusion Dependencies with Independence Atoms

Infamously, the finite and unrestricted implication problems for the cla...