Homomorphism closed vs. existential positive

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 311-320

  Feder, Tomás ^a   Vardi, Moshe Y ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; FORMAL LOGIC; MATHEMATICAL MODELS; SEMANTICS; DATABASE SYSTEMS; SYNTACTICS; TERMINOLOGY;

HOMOMORPHISM;

THEOREM PROVING; FORMAL LOGIC;

CONTEXT MODELING; FINITE MODEL THEORY; FINITE STRUCTURES; FIRST ORDER SENTENCES; LOGIC FUNCTIONS; PRESERVATION THEOREMS; SECOND-ORDER LOGIC; SEMANTIC PROPERTIES;

EID: 0041466162     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. S. Abiteboul, R. Hull and V. Vianu, Foundations of databases, Addison-Wesley, 1995.
2. M. Ajtai and and Y. Gurevich, "Monotone versus positive," J. ACM 34(1987), 1004-1015.
3. A. Chandra and D. Harel, Horn-clause queries and generalizations", J. Logic Programming, 1(1985), 1-15.
4. C.C. Chang and H.J. Keisler, Model Theory, North-Holland, 3rd edition, 1990.
5. A. Durand, C. Lautemann, and T Schwentick, "Subclasses of binary NP", J. of Logic and Computation 8(1998), 189-207.
6. H. D. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, 1995.
7. R. Fagin, "Generalized first-order spectra and polynomial-time recognizable sets', in Complexity of Computation, SIAM-AMS Proceedings, Vol. 7 (R. M. Karp, ed.), 1974, 43-73.
8. T. Feder and M. Y. Vardi, "The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory," SIAM J. Computing 28 (1998), 57-104.
9. E. Grädel and E. Rosen, "Preservation theorems for two-variable logic", Mathematical Logic Quarterly, 45(1999), 315-325.
10. R.L. Graham, B.L. Rothschild, and J. H. Spencer, Ramsey Theory, Wiley, 1980.
11. Y. Gurevich, "On Finite Model Theory", in Feasible Mathematics (S.R. Buss and P.J. Scott, eds.), Birkhaeuser, Boston, 1990, 211-219.
12. G. G. Hillebrand, P.C. Kanellakis, H. G. Mairson, and M. Y. Vardi, "Undecidable boundedness problems for database logic programs," J. Logic Programming 25(1995), 163-190.
13. N. Immerman, Descriptive Complexity, Springer-Verlag, 1998
14. P.G. Kolaitis, "Implicit Definability on Finite Structures and Unambiguous Computations", Proc. 5th IEEE Symp. on Logic in Computer Science, 1990, 168-180.
15. P. G. Kolaitis and M. Y. Vardi, "On the expressive power of Datalog: tools and a case study," J. Computer and System Sciences 51(1995), 110-134.
16. P.G. Kolaitis and M.Y. Vardi, "Infinitary logics and 0-1 laws, " Information and computation 98(1992), 258-194.
17. C.H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity," Proc. 20th ACM Symp. on Theory of Computing, 1988, 229-234.
18. E. Rosen, Some aspects of model theory and finite structures, Bulletin of Symbolic Logic, 8(2002), 380-403.