Abstract
We present a model for deductive databases which contain query-driven (or passive) and update-driven (or active) rules. Our approach is based on the assumptions that (a) both inserted and deleted facts are explicitly stored in the database and used in the derivation process and (b) update-driven rules override query-driven derivations. We give formal semantics for such databases using a least fixpoint computation in the context of a three-valued logic. Our objective is to contribute to the foundations of a general theory for so-called intelligent or active databases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.