Boundedness of monadic FO over acyclic structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 571-582

  Kreutzer, Stephan ^a   Otto, Martin ^b   Schweikardt, Nicole ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATA STRUCTURES; PROBLEM SOLVING;

ACYCLIC STRUCTURES; MONADIC FIXED POINTS;

DECISION THEORY;

EID: 38149016216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_50     Document Type: Conference Paper

References (17)

1. Atserias, A., Dawar, A., Grohe, M.: Preservation under extensions on well-behaved finite structures. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1437-1449. Springer, Heidelberg (2005)
2. Atserias, A., Dawar, A., Kolaitis, P.G.: On preservation under homomorphisms and unions of conjunctive queries. Journal of the ACM 53(2), 208-237 (2006)
3. Barwise, J., Moschovakis, Y.: Global inductive definability. Journal of Symbolic Logic 43, 521-534 (1978)
4. mod. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 327-339. Springer, Heidelberg (2005) Also see manuscript of journal paper
5. Benedikt, M., Segoufin, L.: Towards a characterization of order-invariant queries over tame structures. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 276-291. Springer, Heidelberg (2005)
6. Compton, K., Ward Henson, C.: A uniform method for proving lower bounds on the computational complexity of logical theories. In: Abramsky, S., Gabbay, D.M., Maibaum, T. (eds.) Handbook of Logic in Computer Science. Logic and Algebraic Methods, vol. 5, pp. 129-216. Oxford University Press, Oxford (2000)
7. Cosmadakis, S., Gaifman, H., Kanellakis, P., Vardi, M.: Decidable optimization problems for database logic programs. In: Proc. STOC'88, pp. 477-490 (1988)
8. Dawar, A., Grohe, M., Kreutzer, S., Schweikardt, N.: Approximation schemes for first-order definable optimisation problems. In: Proc. LICS'06, pp. 411-420 (2006)
9. Gaifman, H.: On local and non-local properties. In: Stern, J. (ed.) Herbrand Symposium, Logic Colloquium '81, pp. 105-135. North-Holland, Amsterdam (1982)
10. Gaifman, H., Mairson, H., Sagiv, Y., Vardi, M.: Undecidable optimization problems for database logic problems. Journal of the ACM 40, 683-713 (1993)
11. Hillebrand, G., Kanellakis, P., Mairson, H., Vardi, M.: Undecidable boundedness problems for datalog programs. Journal of Logic Programming 25, 163-190 (1995)
12. Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)
13. Kolaitis, P., Otto, M.: On the boundedness problem for two-variable first-order logic. In: Proc. LICS'98, pp. 513-524 (1998)
14. Kolaitis, P., Otto, M.: On the boundedness problem for fragments of first-order logic: undecidability results. Unpublished draft (1999)
15. Otto, M.: Eliminating recursion in the μ-calculus. In: Meinel, C., Tison, S. (eds.) STACS 99. LNCS, vol. 1563, pp. 531-540. Springer, Heidelberg (1999)
16. Otto, M.: The boundedness problem for monadic universal first-order logic. In: Proc. LICS'06, pp. 37-46 (2006)
17. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol. 3, pp. 389-455. Springer, Heidelberg (1997)