A Rational and Efficient Algorithm for View Revision in Databases

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 this paper, we argue that to apply rationality result of belief dynamics theory to various practical problems, it should be generalized in two respects: first of all, 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, along with the concept of a generalized revision algorithm for Horn knowledge bases. We show that Horn knowledge base dynamics has interesting connection with kernel change and abduction. Finally, we also show that both variants are rational in the sense that they satisfy certain rationality postulates stemming from philosophical works on belief dynamics.

[1]  Nicolas Spyratos,et al.  Updating intensional predicates in deductive databases , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[2]  Sven Ove Hansson,et al.  AGM 25 Years , 2011, J. Philos. Log..

[3]  Lakhdar Sais,et al.  Combining Nonmonotonic Reasoning and Belief Revision: A Practical Approach , 1998, AIMSA.

[4]  Ernest Teniente,et al.  A Survey of Current Methods for Integrity Constraint Maintenance and View Updating , 1999, ER.

[5]  Diego Calvanese,et al.  View-based query answering in Description Logics: Semantics and complexity , 2012, J. Comput. Syst. Sci..

[6]  Guilin Qi,et al.  A Survey of Revision Approaches in Description Logics , 2008, Description Logics.

[7]  Marco Schaerf,et al.  The Compactness of Belief Revision and Update Operators , 2004, Fundam. Informaticae.

[8]  S. Hansson,et al.  Twenty-Five Years of Research in Belief Change , 2011 .

[9]  Mikhail R. Kogalovsky.  Ontology-based data access systems , 2012, Programming and Computer Software.

[10]  Sven Ove Hansson,et al.  A Textbook Of Belief Dynamics , 1999 .

[11]  Carlo Zaniolo,et al.  Deductive Databases: Challenges, Opportunities and Future Directions (Panel Discussion) , 1996, Logic in Databases.

[12]  John Grant,et al.  Integrity Constraints: Semantics and Applications , 1998, Logics for Databases and Information Systems.

[13]  Jack Minker,et al.  Deductive database , 2003 .

[14]  Chandrabose Aravindan,et al.  Belief Dynamics, Abduction, and Database , 1994, JELIA.

[15]  Jianzhong Li,et al.  On the Complexity of View Update Analysis and Its Application to Annotation Propagation , 2012, IEEE Transactions on Knowledge and Data Engineering.

[16]  James P. Delgrande,et al.  Revising Horn Theories , 2011, IJCAI.

[17]  Guillermo Ricardo Simari,et al.  Prioritized and Non-prioritized Multiple Change on Belief Bases , 2011, Journal of Philosophical Logic.

[18]  Wenjin Lu,et al.  View Updates in Disjunctive Deductive Databases Based on SLD-Resolution , 1999, KRDB.

[19]  Andreas Herzig,et al.  Propositional Belief Base Update and Minimal Change , 1999, Artif. Intell..

[20]  Ron van der Meyden,et al.  Logical Approaches to Incomplete Information: A Survey , 1998, Logics for Databases and Information Systems.

[21]  Husheng Liao,et al.  A Comparative Study of View Update Problem , 2010, 2010 International Conference on Data Storage and Data Engineering.

[22]  E. F. Codd,et al.  Extending the database relational model to capture more meaning , 1979, ACM Trans. Database Syst..

[23]  Bernhard Nebel,et al.  How Hard is it to Revise a Belief Base , 1996 .

[24]  S. Wrobel.  First Order Theory Reenement , 1996 .

[25]  Sébastien Konieczny,et al.  Dynamics of Beliefs , 2011, SUM.

[26]  Gerhard Lakemeyer.  A Logical Account of Relevance , 1995, IJCAI.

[27]  Robert A. Kowalski.  Logic without model theory , 1994 .

[28]  Miroslaw Truszczynski,et al.  The View-Update Problem for Indefinite Databases , 2013, SEBD.

[29]  Atocha Aliseda,et al.  Abductive Reasoning: Logical Investigations into Discovery and Explanation , 2006 .

[30]  Odile Papini,et al.  Knowledge-base revision , 2000, The Knowledge Engineering Review.

[31]  Matilde Celma,et al.  Transaction Trees for Knowledge Revision , 2000, FQAS.

[32]  Henning Christiansen,et al.  On Simplification of Database Integrity Constraints , 2006, Fundam. Informaticae.

[33]  Oliver Schulte.  Minimal Belief Change and Pareto-Optimality , 1999, Australian Joint Conference on Artificial Intelligence.

[34]  Abhaya C. Nayak,et al.  Is Revision a Special Kind of Update? , 2011, Australasian Conference on Artificial Intelligence.

[35]  Verónica Dahl,et al.  Abductive Logic Grammars , 2009, WoLLIC.

[36]  Ernest Teniente,et al.  On the abductive or deductive nature of database schema validation and update processing problems , 2003, Theory and Practice of Logic Programming.

[37]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[38]  Krister Segerberg.  Irrevocable Belief Revision in Dynamic Doxastic Logic , 1998, Notre Dame J. Formal Log..

[39]  Paolo Liberatore,et al.  The Complexity of Belief Update , 1997, IJCAI.

[40]  Jack Minker,et al.  Logic and Databases: A 20 Year Retrospective , 1996, Logic in Databases.

[41]  Fangzhen Lin,et al.  Forgetting and Knowledge Update , 2006, Australian Conference on Artificial Intelligence.

[42]  Joachim Biskup.  Inference-usability confinement by maintaining inference-proof views of an information system , 2012, Int. J. Comput. Sci. Eng..

[43]  Arthur M. Keller,et al.  Updating relational databases through views , 1985 .

[44]  Balázs Szörényi,et al.  Horn Complements: Towards Horn-to-Horn Belief Revision , 2008, AAAI.

[45]  Andreas Behrend,et al.  A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases , 2008, FoIKS.

[46]  Jorge Lobo,et al.  Minimal and Consistent Evolution of Knowledge Bases , 1997, J. Appl. Non Class. Logics.

[47]  Sven Ove Hansson.  A Test Battery for Rational Database Updating , 1996, Artif. Intell..

[48]  Kazuhisa Makino,et al.  On computing all abductive explanations from a propositional Horn theory , 2007, JACM.