ACM Home Page
Please provide us with feedback. Feedback
Pushing constraint selections
Full text PdfPdf (1.44 MB)
Source Symposium on Principles of Database Systems archive
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
San Diego, California, United States
Pages: 301 - 315  
Year of Publication: 1992
ISBN:0-89791-519-4
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Citation Count: 21
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/137097.137897
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
BKMR89
Isaac Balbin, David B. Kemp, Krishnamurthy Meenakshi, and Kotagiri Ramamohanarao. Propagating constraints in recursive deductive databases. In Proceedings of the North American Conference on Logic Programming, pages 16-20, October 1989.
BNW91
BS91
Cho90
 
GS91
P.A. Gardner and J.C. Shepherdson. Unfold/Fold transformations of logic programs. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic. The MIT Press, 1991.
JL87
KKR90
 
LM88
J-L. Lassez and M. J. Maher. On Fourier's algorithm for linear arithmetic constraints. Technical report, IBM, T. j. Watson Research Center, 1988.
 
Mah89
MFPR90
 
Ram88
Raghu Ramakrishnan. Magic Templates: A spellbinding approach to logic programs. In Proceedings of the International Conference on Logic Programming, pages 140-159, Seattle, Washington, August 1988.
 
Rev90
 
Sri92
Divesh Srivastava. Subsumption in constraint query languages with linear arithmetic constraints. In Second Intern, atzonal Symposium on A rtzficzal Intelhgence and Mathematics, Fort Lauderda.le, Florida, january 1992.
 
TS84
Hisao Tamaki and Taisuke Sato. Unfold/fold transformations of logic programs. In Proceedings of the Second Internatzonal Conference on Logic Programming, pages 127-138, Uppsala, Sweden, July 1984.
 
Ull89
Van90

CITED BY  21

Collaborative Colleagues:
Divesh Srivastava: colleagues
Raghu Ramakrishnan: colleagues