Finite and Algorithmic Model Theory

340 Martin Otto[14] Dawar, A., and Otto, M. 2009. Modal characterisation theorems over specialclasses of frames. Annals of Pure and Applied Logic, 161, 1–42. Extended journalversion of LICS’05 paper.[15] Ebbinghaus, H.-D., and Flum, J. 1999. Finite Model Theory. 2nd edn. Springer.[16] Frick, M., and Grohe, M. 2001. Deciding first-order properties of locally treedecomposablestructures. Journal of the ACM, 48, 1184–1206.[17] Goranko, V., and Otto, M. 2007. Model Theory of Modal Logic. Pages 249–329of: Blackburn, P., van Benthem, J., and Wolter, F. (eds), Handbook of Modal Logic.Elsevier.[18] Gottlob, G., Leone, N., and Scarcello, F. 2001. The complexity of acyclic conjunctivequeries. Journal of the ACM, 43, 431–498.[19] Gottlob, G., Grädel, E., and Veith, H. 2002a. Datalog LITE: A deductive querylanguage with linear time model checking. ACM Transactions on ComputationalLogic, 3, 1–35.[20] Gottlob, G., Leone, N., and Scarcello, F. 2002b. Hypertree decompositions andtractable queries. Journal of Computer and System Sciences, 64, 579–627.[21] Grädel, E. 1999. On the restraining power of guards. Journal of Symbolic Logic,64, 1719–1742.[22] Grädel, E. 2007. Finite model theory and descriptive complexity. Pages 125–230of: Finite Model Theory and Its Applications. Springer.[23] Grädel, E., and Otto, M. 1999. On Logics with Two Variables. Theoretical ComputerScience, 224, 73–113.[24] Grädel, E., and Walukiewicz, I. 1999. Guarded fixed point logic. Pages 45–54of: Proceedings of 14th Annual IEEE Symposium on Logic in Computer ScienceLICS’99.[25] Grädel, E., Hirsch, C., and Otto, M. 2002. Back and forth between guarded andmodal logics. ACM Transactions on Computational Logics, 3, 418–463.[26] Grohe, M. 2008. Logic, graphs, and algorithms. Pages 357–422 of: Flum, J.,Grädel, E., and Wilke, T. (eds), Logic and Automata, History and Perspectives.Amsterdam University Press.[27] Herwig, B. 1995. Extending partial isomorphisms on finite structures. Combinatorica,15, 365–371.[28] Herwig, B. 1998. Extending partial isomorphisms for the small index property ofmany omega-categorical structures. Israel Journal of Mathematics, 107, 93–124.[29] Herwig, B., and Lascar, D. 2000. Extending partial isomorphisms and the profinitetopology on free groups. Transactions of the AMS, 352, 1985–2021.[30] Hodges, W. 1993. Model Theory. Cambridge University Press.[31] Hodkinson, I., and Otto, M. 2003. Finite conformal hypergraph covers and Gaifmancliques in finite structures. Bulletin of Symbolic Logic, 9, 387–405.[32] Hoogland, E., Marx, M., and Otto, M. 1999. Beth definability for the guardedfragment. In: Gebrandy, J., Marx, M., de Rijke, M., and Venema, Y. (eds), JFAK –Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday.Amsterdam University Press. CD-ROM.[33] Immerman, N. 1998. Decsriptive Complexity. Graduate Texts in Computer Science.Springer.[34] Janin, D., and Walukiewicz, I. 1996. On the Expressive Completeness of thePropositional mu-Calculus with Respect to Monadic Second Order Logic. Pages