A New Rational Algorithm for View Updating in Relational Databases
Radhakrishnan Delhibabu, Andreas Behrend

TL;DR
This paper introduces a generalized belief update algorithm for relational databases that incorporates immutable beliefs and non-deductively closed states, utilizing disjunctive logic programming for efficient updates.
Contribution
It presents a novel rational algorithm for view updating in relational databases by integrating belief dynamics with disjunctive logic programming techniques.
Findings
Efficient database updates using disjunctive logic programming.
Connection between belief revision and kernel change via hitting set and abduction.
Extension of standard techniques for query answering and integrity checking.
Abstract
The dynamics of belief and knowledge is one of the major components of any autonomous system that should be able to incorporate new pieces of information. In order to apply the rationality result of belief dynamics theory to various practical problems, it should be generalized in two respects: first it should allow a certain part of belief to be declared as immutable; and second, the belief state need not be deductively closed. Such a generalization of belief dynamics, referred to as base dynamics, is presented in this paper, along with the concept of a generalized revision algorithm for knowledge bases (Horn or Horn logic with stratified negation). We show that knowledge base dynamics has an interesting connection with kernel change via hitting set and abduction. In this paper, we show how techniques from disjunctive logic programming can be used for efficient (deductive) database…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
