Combining relational algebra, SQL, and constraint programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2309, Issue , 2002, Pages 147-161

  Cadoli, Marco ^a   Mancini, Toni ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; QUERY LANGUAGES;

COMBINATORIAL PROBLEM; COMPLEXITY CLASS; CONSTRAINT PROGRAMMING; CONSTRAINT SOLVING; EXPRESSIVE POWER; RELATIONAL ALGEBRA; STANDARD QUERY LANGUAGES; STRONG INTERACTION;

ALGEBRA;

EID: 84947915472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45988-x_12     Document Type: Conference Paper

References (15)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley Publ. Co., Reading, Massachussetts, 1995.
2. J. Beasley, M. Krishnamoorthy, Y. Sharaiha, and D. Abramson. Scheduling aircraft landings-the static case. Transportation Science, 34:180-197, 2000.
3. M. Cadoli and L. Palopoli. Circumscribing datalog: expressive power and complexity. Theor. Comp. Sci., 193:215-244, 1998.
4. M. Cadoli and A. Schaerf. Compiling problem specifications into SAT. In Proceedings of the European Symposium On Programming (ESOP 2001), volume 2028of LNAI, pages 387-401. Springer-Verlag, 2001.
5. ECLiPSe Home page. www-icparc.doc.ic.ac.uk/eclipse/.
6. R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In R. M. Karp, editor, Complexity of Computation, pages 43-74. AMS, 1974.
7. R. Fourer, D. M. Gay, and B. W. Kernigham. AMPL: A Modeling Language for Mathematical Programming. International Thomson Publishing, 1993.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, Ca, 1979.
9. G. Gottlob, P. Kolatis, and T. Schwentick. Existential second-order logic over graphs: Charting the tractability frontier. In Proc. of FOCS 2000. IEEE CS Press, 2000.
10. ILOG optimization suite — white paper. Available at www.ilog.com, 1998.
11. ILOG DBLink 4.1 Tutorial. Available at www.ilog.com, 1999.
12. P. G. Kolaitis and C. H. Papadimitriou. Why not negation by fixpoint? J. of Computer and System Sciences, 43:125-144, 1991.
13. C. H. Papadimitriou. Computational Complexity. Addison Wesley, Reading, MA, 1994.
14. R. Ramakrishnan. Database Management Systems. McGraw-Hill, 1997.
15. P. Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, 1999.