A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Complexity of Counting First-Order Logic for the Subword Order
2020
International Symposium on Mathematical Foundations of Computer Science
This paper considers the structure consisting of the set of all words over a given alphabet together with the subword relation, regular predicates, and constants for every word. We are interested in the counting extension of first-order logic by threshold counting quantifiers. The main result shows that the two-variable fragment of this logic can be decided in two-fold exponential space provided the regular predicates are restricted to piecewise testable ones. This result improves prior
doi:10.4230/lipics.mfcs.2020.61
dblp:conf/mfcs/KuskeS20
fatcat:ydanpbabhfgyzayqcvbdd5scpa