Journal Papers

• P. C. Kanellakis, G. M. Kuper, P. Z. Revesz: Constraint Query Languages , Journal of Computer and System Sciences 51(1), 1995, pp. 26-52.
• F. Afrati, S. Cosmadakis, S. Grumbach and G. M. Kuper, Linear vs. Polynomial Constraints in Database Query Languages, Proc. Second International Workshop on Principles and Practice of Constraint Programming (PPCP), Orcas Island, WA, Springer-Verlag LNCS 874, 1995, pp. 181-192.
• G. M. Kuper: Aggregation in Constraint Databases, In Principles and Practice of Constraint Programming (ed. V. Saraswat and P. Van Hentenryck), MIT Press, 1995.
• G. M. Kuper and M. Y. Vardi: The Logical Data Model , ACM Transactions on Database Systems, 18(3), 1993, pp. 379-413.
• G. M. Kuper and M. Y. Vardi: On the Complexity of Queries in the Logical Data Model, Theoretical Computer Science, 116, 1993, pp. 33-57.
• G. M. Kuper, K. McAloon, K. Palem, K.Perry: A Note on the Parallel Complexity of Anti-Unification, Journal of Automated Reasoning, 9, 1993, pp. 381-389.
• G. M. Kuper: Logic Programming with Sets, Journal of Computer and System Sciences 41(1), 1990, pp. 44-64.
• R. Fagin, G. M. Kuper, J. D. Ullman and M. Y. Vardi: Updating Logical Databases, in Advances in Computing Research, Vol. 3 (ed. P. Kanellakis), JAI Press, 1986, pp. 1-18.
• H. F. Korth, G. M. Kuper, J. Feigenbaum, A. Van Gelder and J. D. Ullman: System/U: A Database System Based on the Universal Relation Assumption, ACM Transactions on Database Systems, 9(3), 1984, pp. 331-347.

Conference Papers

• J. Chomicki, D. Goldin and G. M. Kuper, ``Variable Independence and Aggregation Closure,'' Report ECRC--96--03, ECRC, 1996, to appear in ACM Symposium on Principles of Database Systems, 1996.
• A. Frank, P. Haunold, W. Kuhn and G. M. Kuper, Representation of Geometric Objects as Set of Inequalities, 12th European Workshop on Computational Geometry (CG'96), Muenster, Germany, March 28-29, 1996.
• L. Hermosilla and G. M. Kuper, Towards the Definition of a Spatial Object-Oriented Data Model with Constraints, Proc. 1st Contessa Workshop on Constraint Databases, Friedrichshafen, Germany, 1995. Proceedings published by Springer-Verlag, LNCS 1034, 1996, pp. 120-131.
• J. Chomicki and G. M. Kuper, Measuring Infinite Relations, ACM Symposium on Principles of Database Systems, San Jose, CA, 1995, pp. 78-85.
• M. G. Wallace, M. Freeston and G. M. Kuper, Constraint Databases, Conference on Information Technology and its use in Enviromental Modeling and Protection, Holloway College, Englamd, Jan 9-11, 1995.
• F. Afrati, S. S. Cosmadakis, S. Grumbach, G. M. Kuper: Linear vs. Polynomial Constraints in Database Query Languages, 2nd International Workshop on Principles and Practice of Constraint Programming (PPCP), Orcas Island , 1994.
• P. C. Kanellakis, G. M. Kuper, P. Z. Revesz: Constraint Query Languages , ACM Symposium on Principles of Database Systems, Nashville, TN, 1990, pp. 299-313.
• G. M. Kuper: On The Expressive Power of the Relational Calculus with Arithmetic Constraints, ICDT, 1990, pp. 202-214
• G. M. Kuper: On the Expressive Power of Logic Programming with Sets, ACM Symposium on Principles of Database Systems, Austin, TX, 1988, pp. 10-14.
• G. M. Kuper and M. Y. Vardi, On the Complexity of Queries in the Logical Data Model, Intl. Conference on Database Theory, Bruges, Belgium, 1988, pp. 267-280.
• G. M. Kuper, Logic Programming with Sets, ACM Symposium on Principles of Databases Systems, San Diego, CA, 1987, pp. 11-21.
• G. M. Kuper and M. Y. Vardi, On the Expressive Power of the Logical Data Model, ACM SIGMOD, Austin, TX, 1985, pp. 180-189.
• G. M. Kuper and M. Y. Vardi, A New Approach to Database Logic, ACM Symposium on Principles of Database Systems, Waterloo, Ontario, 1984, pp. 86-96.
• G. M. Kuper, J. D. Ullman and M. Y. Vardi, On the Equivalence of Logical Databases, ACM Symposium on Principle of Database Systems, Waterloo, Ontario, 1984, pp. 221-228.
• G. M. Kuper, K. McAloon, K. Palem and K. J. Perry, Effective Parallel Algorithms for Anti-Unification and Relative Complement, Logic in Computer Science, Edinburgh, Scotland, 1988, pp. 112-120.

Technical Reports

• S. S. Cosmadakis, G. M. Kuper: Expressiveness of First-Order Constraint Languages, ECRC Report, ECRC-94-13, 1994.
• G. M. Kuper and A. Tuzhilin, On the Expressive Power of Infinite Temporal Databases, Report RC 17881, IBM Watson Research Center, 1992, and Report STERN IS-92-16, NYU, 1992.
• G. M. Kuper, LPS: A Logic Programming Language for Nested Relations, Report RC 12624, IBM Watson Research Center, 1987.
• G. M. Kuper, An Algorithm for Reducing Acyclic Hypergraphs, Report STAN-CS-82-892, Stanford University, January 1982.
• G. M. Kuper, The Logical Data Model: A New Approach to Database Logic, Ph. D. Dissertation, Report STAN-CS-85-1069, Stanford University, January 1982.

Editor

• Proceedings 1st CONTESSA Workshop on Constraint Databases, Friedrichshafen, Springer-Verlag LNCS 1034, 1996 (with M. G. Wallace)

Other

• S. Abiteboul, G. M. Kuper, H. G. Mairson, A. A. Shvartsman and M. Y. Vardi, In Memoriam: Paris C. Kanellakis, ACM Computing Surveys, 28(1), pp. 3-16, 1996.