Preservation under extensions on well-behaved finite structures

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1437-1449

  Atserias, Albert ^a   Dawar, Anuj ^b   Grohe, Martin ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; GRAPH THEORY; TREES (MATHEMATICS);

EXISTENTIAL SENTENCES; FINITE STRUCTURES; TREEWIDTH;

COMPUTER SCIENCE;

EID: 26444568627     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_116     Document Type: Conference Paper

References (9)

1. A. Atserias, A. Dawar, and Ph. G. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries. In Proc. 23rd ACM Symp. on Principles of Database Systems, pages 319-329, 2004.
2. R.G. Downey and M.R. Fellows. Parametrized Complexity. Springer-Verlag, 1999.
3. H-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 2 edition, 1999.
4. H-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Springer, 2nd edition, 1994.
5. M. Grohe, J. Flum, and M Frick. Query evaluation via tree-decompositions. Journal of the ACM, 49:716-752, 2002.
6. Y. Gurevich. Toward logic tailored for computational complexity. In M. Richter et al., editors, Computation and Proof Theory, pages 175-216. Springer Lecture Notes in Mathematics, 1984.
7. W. Hodges. Model Theory. Cambridge University Press, 1993.
8. L. Libkin. Elements of Finite Model Theory. Springer, 2004.
9. W. W. Tait. A counterexample to a conjecture of Scott and Suppes. Journal of Symbolic Logic, 24:15-16, 1959.