Homomorphism preservation theorems
暂无分享,去创建一个
[1] R. Lyndon. An interpolation theorem in the predicate calculus. , 1959 .
[2] Phokion G. Kolaitis,et al. Conjunctive-query containment and constraint satisfaction , 1998, PODS.
[3] Leonid Libkin,et al. Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.
[4] Eric Rosen,et al. Some Aspects of Model Theory and Finite Structures , 2002, Bulletin of Symbolic Logic.
[5] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[6] Y. Gurevich. On Finite Model Theory , 1990 .
[7] Benjamin Rossman,et al. Existential positive types and preservation under homomorphisms , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[8] Andreas Blass,et al. Explicit Graphs with Extension Properties , 2005, Bull. EATCS.
[9] S. Feferman,et al. The first order properties of products of algebraic systems , 1959 .
[10] Yuri Gurevich,et al. Datalog vs. first-order logic , 1989, 30th Annual Symposium on Foundations of Computer Science.
[11] Phokion G. Kolaitis. A Tutorial on Finite Model Theory (Abstract) , 1993, LICS.
[12] Maarten Marx,et al. Finite Model Theory and Its Applications , 2007, Texts in Theoretical Computer Science. An EATCS Series.
[13] Phokion G. Kolaitis,et al. On preservation under homomorphisms and unions of conjunctive queries , 2004, PODS '04.
[14] Leonid Libkin,et al. Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .
[15] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .
[16] Saharon Shelah,et al. On the order of countable graphs , 2003, Eur. J. Comb..
[17] Ashok K. Chandra,et al. Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.
[18] Tomás Feder,et al. Homomorphism closed vs. existential positive , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..
[19] Erich Grädel,et al. On Preservation Theorems for Two‐Variable Logic , 1999, Math. Log. Q..
[20] Jaroslav Nesetril,et al. Grad and classes with bounded expansion I. Decompositions , 2008, Eur. J. Comb..
[21] Jaroslav Nesetril,et al. The core of a graph , 1992, Discret. Math..
[22] Eric Rosen. Finite model theory and finite variable logics , 1996 .
[23] Natasha Alechina,et al. Syntax vs. Semantics on Finite Structures , 1997, Structures in Logic and Computer Science.
[24] Jaroslav Nesetril,et al. Tree-depth, subgraph coloring and homomorphism bounds , 2006, Eur. J. Comb..
[25] R. Lyndon. PROPERTIES PRESERVED UNDER HOMOMORPHISM , 1959 .
[26] John T. Baldwin,et al. Finite and Infinite Model Theory - A Historical Perspective , 2000, Log. J. IGPL.
[27] William W. Tait,et al. A counterexample to a conjecture of Scott and Suppes , 1959, Journal of Symbolic Logic.
[28] Yuri Gurevich,et al. Toward logic tailored for computational complexity , 1984 .
[29] Albert Atserias,et al. On digraph coloring problems and treewidth duality , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[30] Dan Suciu,et al. Journal of the ACM , 2006 .
[31] F. E.. A Relational Model of Data Large Shared Data Banks , 2000 .
[32] Jitender S. Deogun,et al. On Vertex Ranking for Permutations and Other Graphs , 1994, STACS.
[33] Yuri Gurevich. On Finite Model Theory (Extended Abstract) , 1990 .
[34] Jaroslav Nesetril,et al. Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.
[35] Alexei P. Stolboushkin. Finitely monotone properties , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[36] Scott Weinstein,et al. Preservation Theorems in Finite Model Theory , 1994, LCC.
[37] Yuri Gurevich,et al. Monotone versus positive , 1987, JACM.