Algorithmic Solutions via Model Theoretic Interpretations

  title={Algorithmic Solutions via Model Theoretic Interpretations},
  author={F. A. Zaid and D. Kuske and E. Gr{\"a}del},
Model theoretic interpretations are an important tool in algorithmic model theory. Their applications range from reductions between logical theories to the construction of algorithms for problems, which are hard in general but efficiently solvable on restricted classes of structures, like 3-Colorability on graphs of bounded treewidth. We investigate this tool in three different areas of Algorithmic Model Theory: 1. automata-based decision procedures for logical theories, 2. algorithmic meta… Expand
On the Complexity of Infinite Advice Strings
The main results explore the connections between classes of advice automatic structures, MSO-transductions and two-way transducers and suggest a closer study of the resulting hierarchy over infinite words. Expand
Automatic Structures: Twenty Years Later
This tutorial presents an introduction into the history and basic definitions of automatic structures, and surveys the achievements in the study of different variants ofautomatic structures. Expand
Comparing the power of advice strings: a notion of complexity for infinite words
The main results explore the connections between classes of advice automatic structures, MSO-transductions and two-way transducers and suggest a closer study of the resulting hierarchy over infinite words. Expand
Second-Order Finite Automata
It is shown that sets of sets of strings represented by second-order finite automata are closed under the usual Boolean operations, such as union, intersection, difference and even under a suitable notion of complementation, and emptiness of intersection and inclusion are decidable. Expand


Automatic structures
  • Achim Blumensath, E. Grädel
  • Computer Science
  • Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
  • 2000
This work determines the complexity of model checking and query evaluation on automatic structures for fragments of first-order logic and gives model-theoretic characterisations for automatic structures via interpretations. Expand
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree
This work proposes a general method based on Ehrenfeucht-Fraisse games to give upper bounds on the size of these automata and on the time required to build them and concludes that the very general and simple automata-based algorithm works well to decide the first-order theories over these structures. Expand
Decidability of second-order theories and automata on infinite trees
Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results. The method of solution involvesExpand
Ehrenfeucht-Fraïssé goes automatic for real addition
  • F. Klaedtke
  • Computer Science, Mathematics
  • Inf. Comput.
  • 2010
A double exponential upper bound on the automata size for FO(R,+,<) and an exponential upper bounds for the first-order theory of the discrete order over the integers FO(Z,<) are established. Expand
Feasible computation through model theory
The computational complexity of a problem is usually defined in terms of the resources required on some machine model of computation. An alternative view looks at the complexity of describing theExpand
Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
This work defines two graded back-and-forth systems, and uses them to derive bounds on the automata size by establishing a connection between those systems and languages that can be described by formulas in the respective logics. Expand
Complete Problems for Fixed-Point Logics
This class gives a natural description of the fixed-point process of an inductive fix-point formula and hence sheds some light on completely different aspects of the logic than Dahlhaus's construction, which is strongly based on the features of least fixed- point formulae. Expand
Logic, graphs, and algorithms
  • Martin Grohe
  • Computer Science, Mathematics
  • Logic and Automata
  • 2007
An introduction into the theory underlying algorithmic meta theorems and a survey of the most important results in this area are presented. Expand
A hierarchy of tree-automatic structures
It is obtained that there exist infinitely many ωn- automatic, hence also ω-tree-automatic, atomless boolean algebras, which are pairwise isomorphic under the continuum hypothesis CH and pairwise non isomorph under an alternate axiom AT, strengthening a result of [14]. Expand
A Hierarchy of Automatic Words having a Decidable MSO Theory
We investigate automatic presentations of infinite words. Starting points of our study are the works of Rigo and Maes, and Carton and Thomas concerning the lexicographic presentation, respectivelyExpand