Descriptive complexity of real computation and probabilistic independence logic

We introduce a novel variant of BSS machines called Separate Branching BSS machines (S-BSS in short) and develop a Fagin-type logical characterisation for languages decidable in nondeterministic polynomial time by S-BSS machines. We show that NP on S-BSS machines is strictly included in NP on BSS machines and that every NP language on S-BSS machines is a countable disjoint union of closed sets in the usual topology of Rn. Moreover, we establish that on Boolean inputs NP on S-BSS machines without real constants characterises a natural fragment of the complexity class ∃R (a class of problems polynomial time reducible to the true existential theory of the reals) and hence lies between NP and PSPACE. Finally we apply our results to determine the data complexity of probabilistic independence logic.

[1]  Jukka Corander,et al.  A Logical Approach to Context-Specific Independence , 2016, WoLLIC.

[2]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[3]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[4]  Jonni Virtema,et al.  Facets of Distribution Identities in Probabilistic Team Semantics , 2019, JELIA.

[5]  Klaus Meer,et al.  Descriptive complexity theory over the real numbers , 1995, STOC '95.

[6]  Arne Meier,et al.  Team Semantics for the Specification and Verification of Hyperproperties , 2018, MFCS.

[7]  Klaus Meer,et al.  Two logical hierarchies of optimization problems over the real numbers , 2005, Math. Log. Q..

[8]  Marcus Schaefer,et al.  Fixed Points, Nash Equilibria, and the Existential Theory of the Reals , 2017, Theory of Computing Systems.

[9]  Nitakshi Goyal,et al.  General Topology-I , 2017 .

[10]  Klaus Meer.  Counting problems over the reals , 2000, Theor. Comput. Sci..

[11]  Yuri Gurevich,et al.  Metafinite Model Theory , 1994, LCC.

[12]  Michael Benedikt,et al.  Reachability and connectivity queries in constraint databases , 2003, J. Comput. Syst. Sci..

[13]  Klaus Meer,et al.  Two logical hierarchies of optimization problems over the real numbers , 2006, Math. Log. Q..

[14]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[15]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[16]  Lauri Hella,et al.  Inclusion Logic and Fixed Point Logic , 2013, CSL.

[17]  Felipe Cucker,et al.  Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets , 2006, J. Complex..

[18]  Klaus Meer,et al.  Logics which capture complexity classes over the reals , 1999 .

[19]  Pascal Koiran.  Computing over the Reals with Addition and Order , 1994, Theor. Comput. Sci..

[20]  Miika Hannula,et al.  A finite axiomatization of conditional independence and inclusion dependencies , 2016, Inf. Comput..

[21]  Tillmann Miltzow,et al.  The art gallery problem is ∃ ℝ-complete , 2018, STOC.

[22]  Stephan Kreutzer.  Fixed-point query languages for linear constraint databases , 2000, PODS '00.

[23]  Arne Meier,et al.  Approximation and dependence via multiteam semantics , 2015, Annals of Mathematics and Artificial Intelligence.

[24]  Pietro Galliani,et al.  Game values and equilibria for undetermined sentences of Dependence Logic , 2008 .

[25]  Yuri Gurevich,et al.  Metafinite Model Theory , 1994, Inf. Comput..

[26]  Gianluca Paolini,et al.  A logic for arguing about probabilities in measure teams , 2017, Arch. Math. Log..

[27]  Marcus Schaefer,et al.  Complexity of Some Geometric and Topological Problems , 2009, GD.

[28]  Stephan Kreutzer,et al.  Descriptive Complexity Theory for Constraint Databases , 1999, CSL.

[29]  Pietro Galliani,et al.  On Dependence Logic , 2013, Johan van Benthem on Logic and Information Dynamics.

[30]  Klaus Meer,et al.  Logics Which Capture Complexity Classes Over The Reals , 1999, J. Symb. Log..

[31]  Arne Meier,et al.  Probabilistic team semantics , 2018, FoIKS.