On the complexity and axiomatizability of consistent database states

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Marc H. Graham Georgia Institute of Technology
Moshe Y. Vardi IBM Research Laboratory, San Jose
Published in:
· Proceeding
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Pages 281 - 289
ACM New York, NY, USA ©1984
table of contents ISBN:0-89791-128-8 doi>10.1145/588011.588052
On the complexity and axiomatizability of consistent database states Published by ACM 1984 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 145
· Citation Count: 5


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder