Infinite trees and automaton-definable relations over &ohgr;-words
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A decision procedure for term algebras with queues
ACM Transactions on Computational Logic (TOCL)
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A Model-Theoretic Approach to Regular String Relations
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Integrating decision procedures for temporal verification
Integrating decision procedures for temporal verification
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
Automatic structures of bounded degree revisited
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Decision procedures for queues with integer constraints
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The complexity of one-agent refinement modal logic
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
The complexity of one-agent refinement modal logic (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We prove an upper bound result for the first-order theory of a structure W of queues, i.e. words with two relations: addition of a letter on the left and on the right of a word. Using complexity-tailored Ehrenfeucht games we show that the witnesses for quantified variables in this theory can be bound by words of an exponential length. This result, together with a lower bound result for the first-order theory of two successors [6], proves that the first-order theory of W is complete in LATIME(2O(n)): the class of problems solvable by alternating Turing machines running in exponential time but only with a linear number of alternations.