Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants release_ggcv5oku4vgulkul4fwesjsqfq

by Emanuel Kieronski, Lidia Tendera

Released as a article .

2016  

Abstract

We consider extensions of the two-variable guarded fragment, GF2, where distinguished binary predicates that occur only in guards are required to be interpreted in a special way (as transitive relations, equivalence relations, pre-orders or partial orders). We prove that the only fragment that retains the finite (exponential) model property is GF2 with equivalence guards without equality. For remaining fragments we show that the size of a minimal finite model is at most doubly exponential. To obtain the result we invent a strategy of building finite models that are formed from a number of multidimensional grids placed over a cylindrical surface. The construction yields a 2NExpTime-upper bound on the complexity of the finite satisfiability problem for these fragments. We improve the bounds and obtain optimal ones for all the fragments considered, in particular NExpTime for GF2 with equivalence guards, and 2ExpTime for GF2 with transitive guards. To obtain our results we essentially use some results from integer programming.
In text/plain format

Archived Files and Locations

application/pdf  345.7 kB
file_pz4svwhcpjeuzn5hay32sjxcke
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-11-10
Version   v1
Language   en ?
arXiv  1611.03267v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: d5c44597-4de9-40ae-85fd-b59d1951803d
API URL: JSON