Stéphane Grumbach
- ACGK94.F. Afrati, S. Cosmadakis, S, Grambach, and G. Kuper. Expressiveness of linear vs. polynomial constraints in database query languages. In Second Workshop on the Principles and Practice of Constraint Programming, 1994. Google Scholar
Digital Library
- ACM88.D. Arnon, G. Collins, and S. McCallum. Cylindrical algebraic decomposition. S/AM j. computing, 13(4):865-889, 1988. Google ScholarDigital Library
- Arn88.D. Arnon. A bibliography of quantifier elimination for real closed fields. Journal of Symbolic Computation, 5:267-274, 1988. Google ScholarDigital Library
- BDLW95.M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. In manuscript, 1995. Google ScholarDigital Library
- BF85.R.L. Burden and J.D. Faires Numerical Analysis (3rd edition). PWS-Kent, Boston, MA, 1985. Google ScholarDigital Library
- BKR86.M. Ben-Or, D. Kozen, and J. Reif. The complexity of elementary algebra and geometry. Journal of Computer and System Sciences, 32:251-264, 1986. Google ScholarDigital Library
- CK73.C.C. Chang and H.J. Keisler. Model Theory, volume 73 of Studies in Logic. North- Holland, 1973.Google Scholar
- CK95.J. Chomicki and G. Kuper. Measuring infinite relations, in Proceedings 14th ACM Symposium on Principles of Database Systems. ACM Press, 1995. Google ScholarDigital Library
- CL82.G.E. Collins and R. Loos. Real zeros of polynomials. Computing, 1982.Google Scholar
- Col75.G.E. Collins. Quantifier elimination for real closed fields by cylindric decompositions. In Proc. 2nd GI Conf. Automata Theory and Formal Languages, volume 35 of Lecture Notes in Computer Science, pages 134-83. Springer- Verlag, 1975. Google ScholarDigital Library
- Dr82.L. Van den Dries. Remarks on Tarski's problem concerning (t#, +, x, exp). In Logic Colloquitmr Elsevier, North-Holland, 1982.Google Scholar
- FK94.C. Faloutsos and I. Kamel. Beyond uniformity and independence: Analysis of rtrees using the concept of fractal dimension. In Proc. 13th ACM Symp. on Principles of Database Systems, pages 4-13, Minneapolis, 1994. Google ScholarDigital Library
- GS94.S. Grumbach and J. Su, Finitely representable databases. In 13th ACM Symp. on Principles of Database Systems, pages 289- 300, Minneapolis, May 1994. Google ScholarDigital Library
- GS95a.S. Grumbach and J. Su. Dense order constraint databases, in 14th ACM Symp. on Principles of Database Systems, San Jose, May 1995. Google ScholarDigital Library
- GS95b.S. Grumbach and J. Su. First-order definability over constraint databases. In Proc. First Int. Conf. on Principles and Practice of Constraint Prograrrgning, Cassis, Sept. 1995. Google ScholarDigital Library
- GST94.S. Grumbach, J. Su, and C. Tollu. Linear constraint query languages: Expressive power and complexity. In D. Leivant, editor, Logic and Computational Complexity Workshop, Indianapolis, 1994. Springer Verlag. to appear in LNCS. Google ScholarDigital Library
- GV88.D.Yu. Gridor'ev and N.N. Vorobjov. Solving systems of polynomial inequalities in subexponential time. Journal of Symbolic Computation, 1988. Google ScholarDigital Library
- KG94.P. Kanellakis and D. Goldin. Constraint programming and database query languages. In Proc. 2nd Conference on Theoretical Aspects of Computer Software (TACS), 1994. Google ScholarDigital Library
- KKR90.P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 299-313, Nashville, 1990. Google ScholarDigital Library
- Knu69.D.E. Knuth. The Art of Computer Programming, Vol. 2, Seminumerical Algorithms. Addison Wesley, 1969. Google ScholarDigital Library
- KRVV93.P. Kanellakis, S. Ramaswamy, D. Vengroff, and J. Vitter. Indexing for data models with constraints and classes. In Proc. 12th ACM Symp. on Principles of Database Systems, pages 233--243, 1993. Google ScholarDigital Library
- Kup93.G. Kuper. Aggregation in constraint databases. In Proc. First Workshop on Principles and Practice of Constraint Programming, 1993.Google Scholar
- Moo66.R.E. Moore. IntervaI Analysis. Prentice- Hall, 1966.Google Scholar
- Nef90.C. Neff. Specified precision polynomial root isolation is in NC. In Proc IEEE Foundations of Computer Science, 1990.Google ScholarDigital Library
- Pan92.V. Pan. Complexity of computations with matrices and polynomials. SIAM Review, 34(2):225-62, 1992. Google ScholarDigital Library
- PVV94.J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a theory of spatial database queries. In Proc. 13th ACM Syrup. on Principles of Database Systems, pages 279- 288, 1994. Google ScholarDigital Library
- PVV95.J. Paredaens, J. Van den Bussche, and D. Van Gucht. First-order queries on finite structures over the reals. In Proceedings 10th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1995. Google ScholarDigital Library
- PTVF92.W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery. Numerical Recipes in C (Second Edition). Cambridge University Press, 1992 Google ScholarDigital Library
- Ren92a.J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation, 13:255--352, 1992. Google ScholarDigital Library
- Ren92b.J. Renegar. On the computational complexity of approximating solutions for real algebraic fromulae. SIAM Journal of Computing, 21:1008-1025, 1992. Google ScholarDigital Library
- SA94.B. Sendov and A. Andreev. Approximation and interpolation theory. In P. G. Ciarlet and J. L. Lions, editors, Handbook of Numerical Analysis, volume III, pages 223-464. North- Holland, 1994.Google Scholar
- Tar51.A. Tarski. A Decision method for elementary algebra and geometry. Univ. of California Press, Berkeley, California, 1951.Google ScholarCross Ref
- Wei85.K. Weierstrass. 0bet die analytische Darstellung sogenannter wiUkurlicher Funktionen einer reelen Veranderlichen. Sitzu#sber. der Akad. zu Berlin, pages 633--9, 1885.Google Scholar
- Yap94.C.K. Yap. #damental Problems in Algorithmic Algebra. Princeton University Press, 1994. Google ScholarDigital Library
Index Terms
- Towards practical constraint databases (extended abstract)
Recommendations
An Extended Algebra for Constraint Databases
Constraint relational databases use constraints to both model and query data. A constraint relation contains a finite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, ...
Constraint Databases
WISE '00: Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 2 - Volume 2Constraint Databases (CDBs) are the combination of Constraint Logic Programming (CLP, which is one of the strategic directions in computing research) and database technology. CDBs represent a new kind of post-relational databases, naturally extending ...
A Case Study in Engineering SQL Constraint Database Systems (Extended Abstract)
ICLP '08: Proceedings of the 24th International Conference on Logic ProgrammingPractical contexts for constraint satisfaction problems (CSP) often involve large relational databases. The recent proposal by Cadoli and Mancini, CONSQL, shows that a simple extension to SQL provides a viable basis for modeling CSP [1]. This enables ...
Comments