8,356 research outputs found
Logic Meets Algebra: the Case of Regular Languages
The study of finite automata and regular languages is a privileged meeting
point of algebra and logic. Since the work of Buchi, regular languages have
been classified according to their descriptive complexity, i.e. the type of
logical formalism required to define them. The algebraic point of view on
automata is an essential complement of this classification: by providing
alternative, algebraic characterizations for the classes, it often yields the
only opportunity for the design of algorithms that decide expressibility in
some logical fragment.
We survey the existing results relating the expressibility of regular
languages in logical fragments of MSO[S] with algebraic properties of their
minimal automata. In particular, we show that many of the best known results in
this area share the same underlying mechanics and rely on a very strong
relation between logical substitutions and block-products of pseudovarieties of
monoid. We also explain the impact of these connections on circuit complexity
theory.Comment: 37 page
A Fragment of Dependence Logic Capturing Polynomial Time
In this paper we study the expressive power of Horn-formulae in dependence
logic and show that they can express NP-complete problems. Therefore we define
an even smaller fragment D-Horn* and show that over finite successor structures
it captures the complexity class P of all sets decidable in polynomial time.
Furthermore we study the question which of our results can ge generalized to
the case of open formulae of D-Horn* and so-called downwards monotone
polynomial time properties of teams
Efficient Solving of Quantified Inequality Constraints over the Real Numbers
Let a quantified inequality constraint over the reals be a formula in the
first-order predicate language over the structure of the real numbers, where
the allowed predicate symbols are and . Solving such constraints is
an undecidable problem when allowing function symbols such or . In
the paper we give an algorithm that terminates with a solution for all, except
for very special, pathological inputs. We ensure the practical efficiency of
this algorithm by employing constraint programming techniques
A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment
Recently, the separated fragment (SF) has been introduced and proved to be
decidable. Its defining principle is that universally and existentially
quantified variables may not occur together in atoms. The known upper bound on
the time required to decide SF's satisfiability problem is formulated in terms
of quantifier alternations: Given an SF sentence
in which is quantifier free, satisfiability can be decided in
nondeterministic -fold exponential time. In the present paper, we conduct a
more fine-grained analysis of the complexity of SF-satisfiability. We derive an
upper and a lower bound in terms of the degree of interaction of existential
variables (short: degree)}---a novel measure of how many separate existential
quantifier blocks in a sentence are connected via joint occurrences of
variables in atoms. Our main result is the -NEXPTIME-completeness of the
satisfiability problem for the set of all SF sentences that have
degree or smaller. Consequently, we show that SF-satisfiability is
non-elementary in general, since SF is defined without restrictions on the
degree. Beyond trivial lower bounds, nothing has been known about the hardness
of SF-satisfiability so far.Comment: Full version of the LICS 2017 extended abstract having the same
title, 38 page
On Second-Order Monadic Monoidal and Groupoidal Quantifiers
We study logics defined in terms of second-order monadic monoidal and
groupoidal quantifiers. These are generalized quantifiers defined by monoid and
groupoid word-problems, equivalently, by regular and context-free languages. We
give a computational classification of the expressive power of these logics
over strings with varying built-in predicates. In particular, we show that
ATIME(n) can be logically characterized in terms of second-order monadic
monoidal quantifiers
On the strictness of the quantifier structure hierarchy in first-order logic
We study a natural hierarchy in first-order logic, namely the quantifier
structure hierarchy, which gives a systematic classification of first-order
formulas based on structural quantifier resource. We define a variant of
Ehrenfeucht-Fraisse games that characterizes quantifier classes and use it to
prove that this hierarchy is strict over finite structures, using strategy
compositions. Moreover, we prove that this hierarchy is strict even over
ordered finite structures, which is interesting in the context of descriptive
complexity.Comment: 38 pages, 8 figure
- …