On the decidability and complexity of query answering over inconsistent and incomplete databases
A. Cal\`ı, D. Lembo, and R. Rosati. Proceedings of the Twenty-Second Symposium on Principles of Database Systems, page 260--271. New York, NY, USA, ACM, (2003)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 paper:cali:2003
%A Cal\`ı, Andrea
%A Lembo, Domenico
%A Rosati, Riccardo
%B Proceedings of the Twenty-Second Symposium on Principles of Database Systems
%C New York, NY, USA
%D 2003
%I ACM
%K query
%P 260--271
%T On the decidability and complexity of query answering over inconsistent and incomplete databases
@inproceedings{paper:cali:2003,
added-at = {2011-07-11T13:08:08.000+0200},
address = {New York, NY, USA},
author = {Cal\`{\i}, Andrea and Lembo, Domenico and Rosati, Riccardo},
biburl = {https://www.bibsonomy.org/bibtex/23c96bc84b3424bc4d5e63c773e3e4ba7/mschuber},
booktitle = {Proceedings of the Twenty-Second Symposium on Principles of Database Systems},
interhash = {79d42ccbd60019e0395d3d60906c277f},
intrahash = {3c96bc84b3424bc4d5e63c773e3e4ba7},
keywords = {query},
pages = {260--271},
publisher = {ACM},
timestamp = {2011-07-11T13:08:08.000+0200},
title = {On the decidability and complexity of query answering over inconsistent and incomplete databases},
year = 2003
}
