Abstract
The premise that all integrity constraints be totally satisfied guarantees the correctness of methods for simplified integrity checking, and of semantic query optimization. This premise can be waived for many integrity checking methods. We study how it can be relaxed also for applying semantic query optimization to an inconsistency-tolerant evaluation of simplified constraints. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Decker, H. (2008). Extending inconsistency-tolerant integrity checking by semantic query optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5181 LNCS, pp. 89–96). https://doi.org/10.1007/978-3-540-85654-2_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
