An informal introduction to constraint database systems

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

Volumn 1191, Issue , 1996, Pages 7-52

  Gaede, Volker ^a   Wallace, Mark ^b  

^a CSIRO   (Australia)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Advanced databases; Constraint database system; Constraint logic programming; Constraint programming; Multidimensional access methods

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; DATABASE SYSTEMS; HIGH LEVEL LANGUAGES; LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING; OBJECT-ORIENTED DATABASES;

CONSTRAINT DATABASES; CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT PROGRAMMING; DATABASE MODELS; MULTIDIMENSIONAL ACCESS METHODS; OBJECT ORIENTED; PROMINENT FEATURES; RECENT RESEARCHES;

RELATIONAL DATABASE SYSTEMS;

EID: 84942356073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62501-1_23     Document Type: Conference Paper

References (154)

1. Abiteboul, S., R. Hull, and V. Vianu (1994). Foundations of Databases. Addison-Wesley.
2. Afrati, F., S. Cosmadakis, S. Grumbach, and G. Kuper (1994). Expressiveness of linear vs. polynomial constraints in database query languages. In A. Borning (Ed.), Second Workshop on Principles and Practice of Constraint Programming (PPCP'94), Seattle WA.
3. Aggoun, A. and N. Beldiceanu (1993). Extending CHIP in order to solve complex scheduling and placement problems. Journal of Mathematical and Computer Modelling 17(7), 57-73.
4. Aschenbrenner, T., A. Brodsky, and Y. Kornatzky (1995). Constraint database approach to spatio-temporal fusion and sensor management. In Proc. ILPS95 Workshop on Constraints, Databases and Logic Programming, Portland, Oregon.
5. Azarmi, N. and W. Abdul-Hameed (1995). Workforce scheduling with constraint logic programming. BT Technology Journal 13(1).
6. Bancilhon, F. and R. Ramakrishnan (1986). An amateur's introduction to recursive query processing strategies. In Proc. ACM Int. Conf. On Management of Data, Washington, D.C., pp. 16-52. Reprinted in (Stonebraker 1994).
7. Beeri, C. (1990). A formal approach to object-oriented databases. IEEE Trans, on Knowledge and Data Engineering 5, 353-382.
8. Belussi, A., E. Bertino, M. Bertolotto, and B. Catania (1995). Generalized relational algebra: Modeling spatial queries in constraint databases. In G. Kuper and M. Wallace (Eds.), Proc. 1st Int. Database Workshop on Constraint Database Systems (CDB'95), Friedrichshafen, Germany, pp. 40-67. LNCS 1034.
9. Benedikt, M., G. Dong, L. Libkin, and L. Wong (1996). Relational expressive power of constraint query languages. In Proc. 15th ACM Symposium on Principles of Database Systems (PODS), Montreal, Canada, pp. 5-16.
10. Benhamou, F. and L. Granvilliers (1996). Combining local consistency, symbolic rewriting and interval methods. In J. Calmet, J. Campbell, and J. Pfalzgraf (Eds.), Artificial Intelligence and Symbolic Mathematical Computation, AISMC-3, pp. 144-159.
11. Benjamin, M., T. Viana, K. Corbett, and A. Silva (1993). Satisfying multiple-rated constraints in a knowledge based decision aid. In Proc. IEEE Conf. On Artificial Intelligence Applications, Orlando.
12. Berchtold, S., D. Keim, and H.-P. Kriegel (1996). The X-tree: An index structure for high-dimensional data. In Proc. 22th Int. Conf. On Very Large Data Bases, pp. 28-39.
13. Bertino, E. (1994). A survey of indexing techniques for object-oriented databases. In (Freytag, Maier, and Vossen 1994), PP- 383-418.
14. Bertino, E. and C. Guglielmina (1992). Optimization of object-oriented queries using path indices. In Int. Workshop on Research Issues in Transactions and Query Processing (RIDE-TQP).
15. Bocca, J. B. (1992). MEG A LOG a programming platform for constructing information systems. In P. Loucopoulos and R. Zicari (Eds.), Conceptual Modelling, Databases and CASE: An integrated View of Information Systems Developments. MacGraw-Hill.
16. Bormann, J., J. Lohse, M. Payer, and R. Schmid (1995). Circuit verification environment cve2. Technical Report Version 1.72, ZFE BT SE 12 Siemens AG. (User Manual and System Description).
17. Borning, A. and B. Freeman-Benson (1995). The OTI constraint solver: A constraint library for constructing graphical user interfaces. In Proc. 1st hit Conf. Principles and Practice of Constraint programming (CP'95). Springer Verlag. LNCS 976.
18. Bressan, S. (1994). Database query optimization and evaluation as constraint satisfaction problem solving. In Workshop on Constraints and Databases, Ithaca, NY, USA, pp. 27-40. Available as technical report from the University of Nebraska UNL- CSE-94-025.
19. Bressan, S., A. Sexton, and M. Wallace (1996). Implementing index structures using constraint logic programming. In Workshop on Constraints and Databases. In this volume.
20. Brinkhoff, T., H.-P. Kriegel, and R. Schneider (1993). Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems. In Proc. 9th Int. Conference on Data Engineering, pp. 40-49.
21. Brodsky, A. (1996). Constraint databases: Promising technique or just intellectual exercise. Available under URL http://www.cs.brown.edu/people/pvh/group.html.
22. Brodsky, A., D. Q. Goldin, and V. E. Segal (1996). On strongly polynomial projections in d-monotone constraint databases. In Workshop on Constraints and Databases, Boston. Available as technical report from George Mason University.
23. Brodsky, A, J. Jaffar. And M. J. Maher (1993). Toward practical constraint databases. In Proc. 19th Int. Conference on Very Large Data Bases (VLDB), Dublin, pp. 567-580.
24. Brodsky, A. and Y. Kornatzky (1995). The LyriC language: Querying constraint objects. In Proc. ACM SIGMOD Conference on Management of Data, San Jose, CA, pp. 35-46.
25. Brodsky, A., C. Lassez, J.-L. Lassez, and M. J. Maher (1995). Seperability of polyhedra for optimal filtering of spatial and constraint data. In Proc. 14th ACM Symposium on Principles of Database Systems (PODS), San Jose, CA, pp. 54-64.
26. Brodsky, A., V. Segal, and P. Exarkhopoulo (1996). The C3 constraint object-oriented database system. Technical Report, Dept. Information and Software Systems Engineering, George Mason University.
27. Brodsky, A. and X. S. Wang (1995). On approximation-based query evaluation, expensive predicates and constraint objects. In Proc. Workshop on Constraints, Databases and Logic Programming, Portland, OR.
28. Buchberger, B. (1985). Grobner Bases: an Algorithmic Method in Polynomial Ideal Theory. In N. K. Bose (Ed.), Multidimensional Systems theory, pp. 184-232. D. Reidel Publishing Company, Dordrecht-Boston-Lancaster.
29. Burgard, W., A. B. Cremers, T. H. Kolbe, and L. Pliimer (1996). Object construction by deduction for a 3D-geo-information system of a mine. In Proc. Practical Applications of Prolog (PAP'96), London.
30. Butterworth, P., A. Otis, and J. Stein (1991). The GemStone object database management system. Communications of the ACM 34(1.0), 64-77.
31. Biittner, W. and H. Simonis (1987). Embedding boolean expressions into logic programming. Journal of Symbolic Computation 4, 191-205.
32. Byon, J.-H. and P. Z. Revesz (1995). DISCO: A constraint database with sets. In G. Kuper and M. Wallace (Eds.), Proc. 1st Int. Database Workshop on Constraint Database Systems (CDB'95), Friedrichshafen, Germany, pp. 68-83. LNCS 1034.
33. Carey M et al. (1988). A data model and query language for EXODUS. In Proc. ACM SIGMOD Conference on Management of Data.
34. Carlier, J. and E. Pinson (1994). Adjustment of heads and tails for the job-shop problem. European Journal of Operations Research 78, 146-161.
35. Caseau, Y. (1989). A formal system for producing demons and rules. In Proc. Of the 1st Conf. On Deductive and Object-Oriented Databases DOOD'89, Kyoto.
36. Caseau, Y. (1990). A deductive object-oriented language. Annals of Mathematics and Artificial Intelligence.
37. Caseau, Y. and F. Laburthe (1994). Improved clp scheduling with task intervals. In P. Van Hentenryck (Ed.), Proceedings of the 11th International Conference on Logic Programming, Santa Margherita. MIT Press.
38. Chandra, A. K. and D. Harel (1980). Computable queries for relational data bases. Journal of Computer and System Science 21(2), 156-178.
39. Chomicki, J., D. Q. Goldin, and G. M. Kuper (1996). Variable independence and aggregation closure. In Proc. 15th ACM Symposium on Principles of Database Systems (PODS), Montreal, Canada, pp. 40-48.
40. Chomicki, J. and G. Kuper (1995). Measuring infinite relations. In Proc. 14th ACM Symposium on Principles of Database Systems (PODS), San Jose, CA, pp. 78-85.
41. Clark, D. A., C. J. Rawlings, J. Shirazi, L.-L. Li, M. Reeve, K. Schuerman, and A. Veron (1993). Solving large combinatorial problems in molecular biology using the elipsys parallel constraint logic programming system. The Computer Journal 36(8), 690-701.
42. Cluet, S. and C. Delobel (1992). A general framework for the optimization of object- oriented queries. In Proc. ACM SIGMOD Conference on Management of Data, pp. 383-392.
43. Codd, E. F. (1970). A relational model for large shared data banks. Communications of the ACM 13(6), 377-387.
44. Codd, E. F. (1972). Relational completeness of database sublanguages. In R. Rustin (Ed.), Data Base Systems, pp. 65-98. Prentice Hall.
45. Cohen, J. (1990). Constraint logic programming languages. Communications of the ACM 33(7), 52-68.
46. Collins, G. E. and H. Hong (1991). Partial Cylindrical Algebraic Decomposition for Quantifier Elimination. Journal of Symbolic Computation 12, 299-328.
47. Cooper, E. C. (1982). On the expressive power of query languages for relational databases. In Proc. First ACM Symp. On Principles of Database Systems (PODS), Los Angeles.
48. COSYTEC. CHIP user manual.
49. COSYTEC (1994). Proceedings of the CHIP users club. COSYTEC SA, Pare Club Orsay TJniversite, 4, rue Jean Rostand, 91893 Orsay Cedex, France.
50. CPLEX (1993). Using the cplex callable library and cplex mixed integer library. Technical Report Version 2.1, CPLEX Optimisation Inc.
51. DeGroot (1986). In D. DeGroot and G. Lindstrom (Eds.), Logic Programming: Functions, Relations and Equations, New Jersey. Prentice-Hall.
52. Donikian, S. and G. Hegron (1994). Constraint management in a declarative design method for 3D scene sketch modelling. In V. J. Saraswat and P. Van Hentenryck (Eds.), Principles and Practice of Constraint Programming. MIT Press.
53. Doursenot, S., D. Clark, C. J. Rawlings, and A. Veron (1993). Contig mapping using elipsys. In Proc. Workshop on 11 AI and the Genome", IJCAI, Chambery, France.
54. Dowling, W. and J. H. Gallier (1984). Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming 1.
55. ECRC (1996). ECLiPSe 5.2. Technical report, ECRC. http://www.ecrc.de/eclipse/eclipse.html.
56. Feldman, J., A. A. Hoyos, N. Sekas, and D. Vergamini (1995). Scheduling engine for LILCO. In Proc. ILOG Solver Users Conference, Paris. Available under http://www.ilog.com.
57. Freeston, M. (1995a). The application of multi-dimensional indexing methods to constraints. In G. Kuper and M. Wallace (Eds.), Proc. 1st Int. Database Workshop on Constraint Database Systems (CDB'95), Friedrichshafen, Germany, pp. 102-119. LNCS 1034.
58. Freeston, M. (1995b). A general solution of the n-dimensional B-tree problem. In Proc. ACM SIGMOD Conference on Management of Data, pp. 80-91.
59. Freuder, E. (1978). Synthesizing constraint expressions. Communications of the ACM 21, 958-966.
60. Freytag, J. C, D. Maier, and G. Vossen (Eds.) (1994). Query Processing for advanced database systems. Morgan Kaufmann.
61. Fromherz, M. P. J. and V. A. Saraswat (1995). Model-based computing: Constructing constraint-based software for electro-mechanical systems. In Proc. Practical Applications of Constraint Technology (PACT'95).
62. Gaede, V. and O. Gitnther (1995a). Constraint-based query optimization and processing. In G. Kuper and M. Wallace (Eds.), Proc. 1st Int. Database Workshop on Constraint Database Systems (CDB'95), Friedrichshafen, Germany, pp. 84-101. LNCS 1034
63. Gaede, V. and O. Giinther (1995b). Survey on multidimensional access methods. Technical Report ISS-15, Humboldt-Universitat zu Berlin, Germany. Submitted.
64. Gaede, V. and W.-F. Riekert (1996). Query evaluation in the object-oriented GIS GODOT. Technical report, Humboldt-Universitat zu Berlin, Germany.
65. Gervet, C. (1994). Conjunto: Constraint logic programming with finite set domains. In Proc. ILPS'94, pp. 339-358.
66. Gleicher, M. (1994). Practical issues in graphical constraints. In V. J. Saraswat and P. Van Hentenryck (Eds.), Principles and Practice of Constraint Programming. MIT Press.
67. Goldin, D. and P. C. Kanellakis (1996). Constraint query algebras. Constraints Journal 1(1).
68. Goldin, D. Q. and P. C. Kanellakis (1995). On similarity queries for time-series data: Constraint specification and implementation. In U. Montanari and F. Rossi (Eds.), Proc. 1st Int. Conference on Principles and Practice of Constraint Programming (CP"95), Cassis, France, pp. 137-153. Springer-Verlag. LNCS 976.
69. Goldstein, J., R. Ramakrishnan, and J.-B. Yu (1996). Using constraints to query R*-trees. In Workshop on Constraints and Databases, Boston. Available as technical report from George Mason University.
70. Graefe, G. (1993). Query evaluation techniques for large databases. ACM Computing Surveys 25(2), 73-170.
71. Granveaud, B. (1995). Study and implementation of spatial indexing methods. Technical report, ECRC, Arabellastr. 17, Miinchen.
72. Grumbach, S. and J. Su (1995). Dense-order constraint databases. In Proc. 14th ACM Symposium on Principles of Database Systems (PODS), San Jose, CA, pp. 66-77.
73. Grumbach, S. and J. Su (1996). Towards practical constraint databases. In Proc. 15th ACM Symposium on Principles of Database Systems (PODS), Montreal, Canada, pp. 28-37.
74. Giinther, 0. (1989). The cell tree: An object-oriented index structure for geometric databases. In Proc. 5th Int. Conference on Data Engineering, pp. 598-605.
75. Giinther, O. and V. Gaede (1996). Oversize shelves: A storage management technique for large spatial data objects. Int. Journal of Geographic Information Systems.
76. Gupta, V., R. Jagadeesan, V. Saraswat, and D. Bobrow (1995). Programming in hybrid constraint languages. In P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry (Eds.), Hybrid Systems II, pp. 552-567. Springer Verlag. LNCS 999.
77. Haas, L., W. Chang, G. Lohman, J. McPherson, P. Wilms, G. Lapis, B. Lindsay, H. Pirahesh, M. J. Carey, and E. Shekita (1990). Starburst mid-flight: As the dust clears. IEEE Trans, on Knowledge and Data Engineering 2(1), 143-161. Reprinted in (Stonebraker 1994).
78. Heintze, N. and J. Jaffar (1994). Set constraints and set-based analysis. In A. Borning (Ed.), Proc. 2nd Workshop on Principles and Practice of Constraint Programming, Seattle WA.
79. Helm, R., T. Huynh, C. Lassez, and K. Marriott (1992). A linear constraint technology for interactive graphic systems. In Proc. Graphics Interface '92, Vancouver.
80. Helm, R., K. Marriott, and M. Odersky (1995). Spatial query optimization: From Boolean constraints to range queries. Journal of Computer and System Science 51, 197-210.
81. Hermosilla, L. and G. Kuper (1995). Towards the definition of a spatial object-oriented data model with constraints. In G. Kuper and M. Wallace (Eds.), Proc. 1st Int. Database Workshop on Constraint Database Systems (CDB'95), Friedrichshafen, Germany, pp. 120-131. LNCS 1034.
82. Hermosilla, L. H. (1993). A requirement analysis for supporting temporal reasoning in geographic information systems. Technical Report ECRC-93-15, ECRC, Arabellastr. 17, Miinchen.
83. Heus, K. and G. Weil (1996). Constraint programming: a nurse scheduling application. In Proc. Practical Applications of Constraint Technology (PACT'96), London, pp. 115-128.
84. Huynh, T. and C. Lassez (1990). An expert decision-support system for option-based investment. Computer Mathematics with Applications 20(9/10), 1-14.
85. Hyvonen, E. (1991). Interval constraint spreadsheets for financial planning. In Proc. First International Conference on Artificial Intelligence Applications on Wall Street. IEEE Computer Society Press.
86. ILOG (1995). Proceedings of the ILOG user-group meeting. Available under http://www.ilog.com.
87. Jaffar, J. and J.-L. Lassez (1986). Constraint logic programming. IBM, Thomas J. Watson Research Center, Yorktown Heights, USA.
88. Jaffar, J. and J.-L. Lassez (1987). Constraint logic programming. In Proceedings of the 14th ACM POI'L Symposium, Munich, West Germany.
89. Jaffar, J. and M. J. Maher (1994). Constraint logic programming: A survey. Journal of Logic Programming 19,20, 503-581.
90. Jagadish, H. V. (1990). Spatial search with polyhedra. In Proc. 6th Int. Conference on Data Engineering, pp. 311-319.
91. Jagadish, H. V. (1991). A retrieval technique for similar shapes. In Proc. ACM SIGMOD Conference on Management of Data, pp. 208-217.
92. Jagadish, H. V. and A. O. Mendelzon (1995). Similarity-based queries. In Proc. 14th ACM Symposium on Principles of Database Systems (PODS), San Jose, CA.
93. Jain, R. (1993). Report on the NSF workshop 011 visual information management systems.
94. Jarke, M. and J. Koch (1984). Query optimization in database systems. ACM Computing Surveys 16, 111-152.
95. Kanellakis, P., S. Ramaswamy, D. Vengroff, and J. Vitter (1993). Indexing for data models with constraints and classes. In Proc. 12th ACM Symposium on Principles of Database Systems (PODS), Washington, DC, pp. 233-243.
96. Kanellakis, P. C. and D. Q. Goldin (1994). Constraint programming and database query languages. Technical report, Brown University, Providence.
97. Kanellakis, P. C, G. Kuper, and P. Revesz (1990). Constraint query languages. In Proc. 9th ACM Symposium on Principles of Database Systems (PODS), Nashville, Tennessee, pp. 299-313.
98. Kanellakis, P. C, G. Kuper, and P. Revesz (1995). Constraint query languages. Journal of Computer and System Science 51(1), 26-52.
99. Kay, P. and H. Simonis (1995). Building industrial CHIP applications from reusable software components. In Proc. Conf. On Practical Applications of Prolog (PAP'95).
100. Kemp, D. and P. Stuckey (1993). Analysis-based constraint query optimization. In D. S. Warren (Ed.), Proc. 10th Int. Conference on Logic Programming, pp. 666-682. MIT Press.
101. Kifer, M., W. Kim, and Y. Sagiv (1992). Querying object-oriented databases. In Proc. ACM SIGMOD Conference on Management of Data, pp. 393-402.
102. Kifer, M. and G. Lausen (1989). F-logic: A higher-order language for reasoning about objects, inheritance, and scheme. In Proc. ACM SIGMOD Conference on Management of Data, pp. 134-146.
103. Koubarakis, M. (1993). Representing and querying in temporal databases: The power of temporal constraints. In Proc. 9th Int. Conference on Data Engineering.
104. Koubarakis, M. (1994). Foundations of indefinite constraint databases. In A. Borning (Ed.), Second Workshop on Principles and Practice of Constraint Programming (PPCP'94), Seattle WA.
105. Koubarakis, M. (1996). Tractable disjunctions of linear constraints. In Proc. 2nd Int. Conf. Principles and Practice of Constraint Programming, (CP'96), Boston. LNCS 1118.
106. Kowalski, R. A., F. Sadri, and P. Soper (1987). Integrity checking in deductive databases. In Proc. Thirteenth Int. Conf. On Very Large Data Bases, Brighton, U.K., pp. 61-69.
107. Kuper, G. M. (1993). Aggregation in constraint databases. In Proc. 1st Workshop on Principles and Practice of Constraint Programming (PPCP'93).
108. Lamb, C, G. Landis, J. Orenstein, and D. Weinreb (1991). The ObjectStore database system. Communications of the ACM 10(34), 50-63.
109. Lazaro, J. M. and P. Aristondo (1996). Job rostering with constraints. In Proc. Practical Applications of Constraint Technology (PACT'96), London, pp. 155-168.
110. Levy, A. and Y. Sagiv (1992). Constraints and redudancy in Datalog. In Proc. 12th ACM Symposium on Principles of Database Systems (PODS), San Diego, CA, pp. 67-80.
111. Mailharro, D. and T. Le Quenven (1995). A constraint-based tool for automatic sizing of an instrument and control architecture. In Proc. ILOG Solver Users Conference, Paris. Available under http://www.ilog.com.
112. Mezzanatto, G., M. Foglino, P. Giordanengo, M. Apra, and G. Gullane (1993). Using AI techniques to design and install electrical bundles. In Proc. 13th International Conf. On Artificial Intelligence, Expert Systems and Natural Language, Avignon.
113. Miranker, D. P., R. J. Bayardo, and V. Samolados (1996). Query evaluation as constraint search: An overview of early results. In Workshop on Constraints and Databases. In this volume.
114. Mishra, P. and M. H. Eich (1992). Join processing in relational databases. ACM Computing Surveys 24,(l), 63-113.
115. Mohr, R. and T. C. Henderson (1986). Arc and path consistency revisited. Artificial Intelligence 28, 225-233.
116. Monfroy, E. (1992). Grobner Bases: Strategies and Applications. In Conference on Artificial Intelligence and Symbolic Mathematical Computations, Karlsruhe, Germany.
117. Montanari, U. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Information Science 7(2), 95-132.
118. Muller, J. (1995). Environmental monitoring system. ESPRIT Project 6757.
119. Mumick, I. S., S. J. Finkelstein, H. Pirahesh, and R. Ramakrishnan (1990). Magic conditions. In Proc. 9th ACM Symposium on Principles of Database Systems (PODS), Nashville, Tennessee, pp. 314-330.
120. Pavlopoulou, C, A. P. Gionis, P. Stamatopoulos, and C. Halatsis (1996). Crew pairing optimisation based on CLP. In Proc. Practical Applications of Constraint Technology (PACT'96), London, pp. 191-210.
121. Puddicombe, A. (1996). National land information service.
122. Puget, J.-F. (1995). Applications of constraint programming. In U. Montanari and F. Rossi (Eds.), Proc. 1st Int. Conference on Principles and Practice of Constraint Programming (CP'95), Cassis, France. Springer-Verlag. LNCS 976.
123. Puget, J.-F. (1996). Finite set intervals. Workshop on Set Constraints. Ramakrishnan, R. (1991). Magic templates. Journal of Logic Programming 11, 189-216.
124. Revesz, P. Z. (1993). A closed form evaluation for datalog queries with integer (gap-) order constraints. Theoretical Computer Science 116(1), 117-149.
125. Revesz, P. Z. (1995a). Datalog queries of set constraint databases. In Proc. Int. Conference on Database Theory, pp. 425-438.
126. Revesz, P. Z. (1995b). Safe stratified Datalog with integer order programs. In U. Montanari and F. Rossi (Eds.), Proc. 1st Int. Conference on Principles and Practice of Constraint Programming (CP'95), Cassis, France, pp. 154-169. Springer-Verlag. LNCS 976.
127. Revesz, P. Z. (1996). Genomic databse applications in DISCO. In Workshop on Constraints and Databases. In this volume.
128. Roman, G.-C. (1990). Formal specification of data processing requirements. IEEE Transactions on Knowledge and Data Engineering 2(12), 370-380.
129. Saraswat, V. (1993). Concurrent Constraint Programming. Logic Programming and Doctoral Dissertion Award Series. MIT Press.
130. Schiwietz, M. (1993). Speicherung und Anfragebearbeitung komplexer Geo-Objekte. Ph. D. thesis, Ludwig-Maximilians Universitat Miinchen. In German.
131. Shankar, A., D. Gilbert, and M. Jampel (1996). Transient analysis of linear circuits using constraint logic programming. In Proc. Practical Applications of Constraint Technology (PACT'96), London, pp. 221-248.
132. Simonis, H. (1995). Application development with the CHIP system. In G. Kuper and M. Wallace (Eds.), Proc. 1st Int. Database Workshop on Constraint Database Systems (CDB'95), Friedrichshafen, Germany, pp. 121. LNCS 1034.
133. Simonis, H. and T. Cornelissens (1995). Modelling producer/consumer constraints. In U. Montanari and F. Rossi (Eds.), Proc. 1st Int. Conference on Principles and Practice of Constraint Programming (CP'95), Cassis, France. Springer-Verlag. LNCS 976.
134. Srivastava, D. and R. Ramakrishnan (1992). Pushing constraint selection. In Proc. 11th ACM Symposium on Principles of Database Systems (PODS), San Diego, CA, pp. 301-315.
135. Srivastava, D., R. Ramakrishnan, and P. Revesz (1994). Constraint objects. In A. Borning (Ed.), Second Workshop on Principles and Practice of Constraint Programming (PPCP'94), Seattle WA.
136. Stolboushkin, A. P. and M. A. Taitslin (1996). Linear vs. order constraint queries over rational databases. In Proc. 15th ACM Symposium on Principles of Database Systems (PODS), Montreal, Canada, pp. 17-27.
137. Stonebraker, M. (Ed.) (1994). Readings in Database Systems, San Mateo. Morgan Kaufmann. Second edition.
138. Stonebraker, M. and G. Kemnitz (1991). The POSTGRES next generation database management system. Communications of the ACM 34(10), 78-92. Reprinted in (Stonebraker 1994).
139. Stuckey, P. J. and S. Sudarshan (1994). Compiling query constraints. In Proc. 13th ACM Symposium on Principles of Database Systems (PODS), Minneapolis, MA, pp. 56-67.
140. Tarski, A. (1951). A Decision Method for Elementary Algebra and Geometry. Berkeley: University of California Press. 2nd revised edition.
141. The Committee for Advanced DBMS Functions (1990). Third-generation database system manifesto. SIGMOD Record 19(3), 31-44. Reprinted in (Stonebraker 1994).
142. The Practical Applications Company (1996). Practical Application of Constraint Technology. The Practical Applications Company.
143. Topor, R. W. (1987). Domain independent formulas and databases. Theoretical Computer Science 52(3), 281-306.
144. Van Emden, M. H. and R. A. Kowalski (1976). The semantics of predicate logic as a programming language. Journal of the ACM 23(4), 733-742.
145. Van Gelder, A. and R. W. Topor (1987). Safety and correct translation of relational calculus formulas. In Proc. ACM Sump, on Principles of Database Systems (PODS), San Diego, Ca., pp. 313-327. Revised version to appear-in ACM Transactions on Database Systems.
146. Van Hentenryck, P. (1989a). A Logic Language for Combinatorial Optimization. Annals of Operations Research: Special Issue on Links with Artificial Intelligence.
147. Van Hentenryck, P. (1989b). Constraint Satisfaction in Logic Programming. Logic Programming Series. Cambridge, MA: MIT Press
148. Van Hentenryck, P., D. McAllester, and D. Kapur (1995). Solving polynomial systems using a branch and prune approach. Si AM Journal on Numerical Analysis.
149. Wallace, M. (1991). Compiling integrity checking into update procedures. In Proc. IJCAI'91, Sydney.
150. Wallace, M. (1996). Practical applications of constraint programming. Constraints Journal 1(1).
151. Wallace, M., S. Bressan, and T. L. Provost (1995). Magic checking: Constraint checking for database query optimisation. In G. Kuper and M. Wallace (Eds.), Proc. 1st Int. Database Workshop on Constraint Database Systems (CDS'95), Friedrichshafcn, Germany, pp. 148-166. LNCS 1034.
152. Wallace, M. G. (1995). Constraints as a tool for distributed scheduling. In Proc. International Conf on Improving Manufacturing Performance in the Distributed Enterprise: Advanced Systems and Tools, pp. 129-146.
153. Yakhno, T. M., G. B. Cheblakov, and V. Z. Zilberfain (1995). FISSURE: Finder of solutions with sub definite resources. In G. Kuper and M. Wallace (Eds.), Proc. 1st Int. Database Workshop on Constraint Database Systems (CDB'95), Friedrichshafen, Germany, pp. 84-101. Springer Verlag. LNCS 1034.
154. Zhang, Y. and A. K. Mackworth (1995). Synthesis of hybrid constraint-based controllers. In P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry (Eds.), Hybrid Systems II, pp. 552-567. Springer Verlag. LNCS 999.