Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Improved limitedness theorems on finite automata with distance functions
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
The limitedness problem on distance automata: Hashiguchi's method revisited
Theoretical Computer Science
The Boundedness Problem for Monadic Universal First-Order Logic
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Eliminating recursion in the µ-calculus
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Boundedness of monadic FO over acyclic structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
The Theory of Stabilisation Monoids and Regular Cost Functions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Regular temporal cost functions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
First-order rewritability of atomic queries in horn description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We prove that the boundedness problem for monadic second-order logic over the class of all finite words is decidable.