Counting of Teams in First-Order Team Logics

02/01/2019
by   Anselm Haak, et al.
0

We study descriptive complexity of counting complexity classes in the range from #P to #·NP. A corollary of Fagin's characterization of NP by existential second-order logic is that #P can be logically described as the class of functions counting satisfying assignments to free relation variables in first-order formulae. In this paper we extend this study to classes beyond #P and extensions of first-order logic with team semantics. These team-based logics are closely related to existential second-order logic and its fragments, hence our results also shed light on the complexity of counting for extensions of FO in Tarski's semantics. Our results show that the class #·NP can be logically characterized by independence logic and existential second-order logic, whereas dependence logic and inclusion logic give rise to subclasses of #·NP and #P , respectively. Our main technical result shows that the problem of counting satisfying assignments for monotone Boolean Σ_1-formulae is #·NP-complete as well as complete for the function class generated by dependence logic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2021

On the Expressive Power of TeamLTL and First-Order Team Logic over Hyperproperties

In this article we study linear temporal logics with team semantics (Tea...
research
05/07/2023

On guarded extensions of MMSNP

We investigate logics and classes of problems below Fagin's existential ...
research
12/23/2020

Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals

Probabilistic team semantics is a framework for logical analysis of prob...
research
01/31/2023

A monotone connection between model class size and description length

This paper links sizes of model classes to the minimum lengths of their ...
research
02/20/2021

Logics of Dependence and Independence: The Local Variants

Modern logics of dependence and independence are based on team semantics...
research
02/01/2023

Parameterized Complexity of Weighted Team Definability

In this article, we study the complexity of weighted team definability f...
research
10/14/2019

On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics

We present syntactic characterisations for the union closed fragments of...

Please sign up or login with your details

Forgot password? Click here to reset