Gaifman normal forms for counting extensions of first-order logic. - In: 45th International Colloquium on Automata, Languages, and Programming, (2018), Seite 133:1-133:14
We consider the extension of first-order logic FO by unary counting quantifiers and generalise the notion of Gaifman normal form from FO to this setting. For formulas that use only ultimately periodic counting quantifiers, we provide an algorithm that computes equivalent formulas in Gaifman normal form. We also show that this is not possible for formulas using at least one quantifier that is not ultimately periodic. Now let d be a degree bound. We show that for any formula phi with arbitrary counting quantifiers, there is a formula gamma in Gaifman normal form that is equivalent to phi on all finite structures of degree <= d. If the quantifiers of phi are decidable (decidable in elementary time, ultimately periodic), gamma can be constructed effectively (in elementary time, in worst-case optimal 3-fold exponential time). For the setting with unrestricted degree we show that by using our Gaifman normal form for formulas with only ultimately periodic counting quantifiers, a known fixed-parameter tractability result for FO on classes of structures of bounded local tree-width can be lifted to the extension of FO with ultimately periodic counting quantifiers (a logic equally expressive as FO+MOD, i.e., first-oder logic with modulo-counting quantifiers).
http://dx.doi.org/10.4230/LIPIcs.ICALP.2018.133
Infinite and bi-infinite words with decidable monadic theories. - In: Logical methods in computer science, ISSN 1860-5974, Bd. 14 (2018), 3:9, S. 1-24
We study word structures of the form (D,<,P) where D is either N or Z, < is the natural linear ordering on D and P⊆D is a predicate on D. In particular we show: (a) The set of recursive ω-words with decidable monadic second order theories is Σ3-complete. (b) Known characterisations of the ω-words with decidable monadic second order theories are transfered to the corresponding question for bi-infinite words. (c) We show that such "tame" predicates P exist in every Turing degree. (d) We determine, for P⊆Z, the number of predicates Q⊆Z such that (Z,≤,P) and (Z,≤,Q) are indistinguishable. Through these results we demonstrate similarities and differences between logical properties of infinite and bi-infinite words.
https://doi.org/10.23638/LMCS-14(3:9)2018
Navigation of autonomous marine robots - novel approaches using cooperating teams. - Ilmenau. - XXXII, 366 Seiten
Technische Universität Ilmenau, Habilitationsschrift 2018
Modelling and essential control of an oceanographic monitoring remotely operated underwater vehicle. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 29, S. 213-219
https://doi.org/10.1016/j.ifacol.2018.09.495
Indirect adaptive control for higher order sliding mode. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 13, S. 591-596
https://doi.org/10.1016/j.ifacol.2018.07.344
IDA-PBC for polynomial systems: an SOS-based approach. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 13, S. 366-371
https://doi.org/10.1016/j.ifacol.2018.07.306
A new method for fault tolerant control through Q-learning. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 24, S. 38-45
https://doi.org/10.1016/j.ifacol.2018.09.526
Path planning for an identification mission of an Autonomous Underwater Vehicle in a lemniscate form. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 29, S. 323-328
https://doi.org/10.1016/j.ifacol.2018.09.503
Modelling the strip thickness in hot steel rolling mills using least-squares support vector machines. - In: The Canadian journal of chemical engineering, ISSN 1939-019X, Bd. 96 (2018), 1, S. 171-178
https://doi.org/10.1002/cjce.22956
Automated system identification in mineral processing industries: a case study using the zinc flotation cell. - In: IFAC-PapersOnLine, ISSN 2405-8963, Bd. 51 (2018), 18, S. 132-137
https://doi.org/10.1016/j.ifacol.2018.09.288