SIGN IN
SIGN UP
Constraints and redundancy in datalog
Full Text:
PDF
Buy this Article
Authors:
Alon Levy
Yehoshua Sagiv
Published in:
· Proceeding
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Pages 67-80
ACM
New York, NY
, USA
©1992
table of contents
ISBN:0-89791-519-4
doi>
10.1145/137097.137111
1992 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 13
· Downloads (cumulative): 204
· Citation Count: 26
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
correctness proofs
datalog
languages
theory
trees
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder