Boundedness of monadic FO over acyclic structures

Authors:
Stephan Kreutzer;Martin Otto;Nicole Schweikardt
Affiliations:
Institut für Informatik, Humboldt Universität zu Berlin;Fachbereich Mathematik, Technische Universität Darmstadt;Institut für Informatik, Humboldt Universität zu Berlin
Venue:
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Year:
2007

Citing 12
Cited 2

Decidable optimization problems for database logic programs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Undecidable optimization problems for database logic programs

Journal of the ACM (JACM)
Languages, automata, and logic

Handbook of formal languages, vol. 3
A uniform method for proving lower bounds on the computational complexity of logical theories

Handbook of logic in computer science
On the Boundedness Problem for Two-Variable First-Order Logic

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On preservation under homomorphisms and unions of conjunctive queries

Journal of the ACM (JACM)
The Boundedness Problem for Monadic Universal First-Order Logic

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Approximation Schemes for First-Order Definable Optimisation Problems

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Eliminating recursion in the µ-calculus

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Preservation under extensions on well-behaved finite structures

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Regular tree languages definable in FO

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Towards a characterization of order-invariant queries over tame structures

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Boundedness of Monadic Second-Order Formulae over Finite Words

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Temporal description logic for ontology-based data access

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very restricted classes of underlying first-order formulae, we here obtain a decidability result for the boundedness issue for monadic fixed points over arbitrary first-order formulae in restriction to acyclic structures.