On the decidability and complexity of query answering over inconsistent and incomplete databases

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Andrea Calì Università di Roma "La Sapienza", Via Salaria 113, Roma, Italy
Domenico Lembo Università di Roma "La Sapienza", Via Salaria 113, Roma, Italy
Riccardo Rosati Università di Roma "La Sapienza", Via Salaria 113, Roma, Italy
Published in:
Cover Image
 
· Proceeding
PODS '03 Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 260-271
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-670-6 doi>10.1145/773153.773179
On the decidability and complexity of query answering over inconsistent and incomplete databases Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 43
· Downloads (cumulative): 852
· Citation Count: 109


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