Modulo Counting on Words and Trees

10/16/2017
by   Bartosz Bednarczyk, et al.
0

We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a technique for deciding the satisfiability problem. In the case of words this gives a new proof of EXPSPACE upper bound, and in the case of trees it gives a 2EXPTIME algorithm. This algorithm is optimal: we prove a matching lower bound by a generic reduction from alternating Turing machines working in exponential space; the reduction involves a development of a new version of tiling games.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2018

The One-Variable Logic Meets Presburger Arithmetic

We consider the one-variable fragment of first-order logic extended with...
research
10/06/2021

One-Dimensional Fragment over Words and Trees

One-dimensional fragment of first-order logic is obtained by restricting...
research
01/11/2021

Register Automata with Extrema Constraints, and an Application to Two-Variable Logic

We introduce a model of register automata over infinite trees with extre...
research
02/05/2018

Unary negation fragment with equivalence relations has the finite model property

We consider an extension of the unary negation fragment of first-order l...
research
02/24/2011

New Worst-Case Upper Bound for #XSAT

An algorithm running in O(1.1995n) is presented for counting models for ...
research
03/06/2023

Friedman's "Long Finite Sequences”: The End of the Busy Beaver Contest

Harvey Friedman gives a comparatively short description of an “unimagina...
research
06/29/2021

The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard

In logic-based knowledge representation, query answering has essentially...

Please sign up or login with your details

Forgot password? Click here to reset