A complete proof procedure for efficient integrity checking in deductive databases

Cita com:
hdl:2117/373508
Document typeConference report
Defense date1992
PublisherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
Rights accessOpen Access
This work is protected by the corresponding intellectual and industrial property rights.
Except where otherwise noted, its contents are licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 4.0 International
Abstract
We present proof procedure for checking the integrity of a deductive database. We follow the proposal of Sadri and Kowalski. Our procedure replaces the latter's meta-level rules by inference rules that are implemented more easily on the resolution level. Also, we adapt and extend conditions that are known to ensure completeness and termination, and show that our procedure is complete and terminates for checking violation and satisfaction of integrity in large classes of databases.
CitationNüssel, G. [et al.]. A complete proof procedure for efficient integrity checking in deductive databases. A: "Proceedings of the 3rd International Workshop on the Deductive Approach to Information Systems and Databases". Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1992, p. 199-216.
Files | Description | Size | Format | View |
---|---|---|---|---|
3DAISD_10_A complete proof procedure.pdf | 993,9Kb | View/Open |