Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity Constraints

Approximation fixpoint theory (AFT) is an algebraic study of fixpoints of lattice operators that unifies various knowledge representation formalisms. In AFT, stratification of operators has been studied, essentially resulting in a theory that specifies when certain types of fixpoints can be computed stratum per stratum. Recently, novel types of fixpoints related to groundedness have been introduced in AFT. In this article, we study how those fixpoints behave under stratified operators. One recent application domain of AFT is the field of active integrity constraints (AICs). We apply our extended stratification theory to AICs and find that existing notions of stratification in AICs are covered by this general algebraic definition of stratification. As a result, we obtain stratification results for a large variety of semantics for AICs.

[1]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[2]  V. Marek,et al.  Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too , 2011, ArXiv.

[3]  Dov M. Gabbay,et al.  What Is Negation as Failure? , 2012, Logic Programs, Norms and Action.

[4]  Peter Scheuermann,et al.  Active Database Systems , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[5]  Victor W. Marek,et al.  Revision Programming , 1998, Theor. Comput. Sci..

[6]  Joost Vennekens,et al.  Partial Grounded Fixpoints , 2015, IJCAI.

[7]  Ioanna Symeonidou,et al.  Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs , 2018, Theory Pract. Log. Program..

[8]  K. U. LeuvenCelestijnenlaan,et al.  Approximations, Stable Operators, Well-founded Fixpoints and Applications in Nonmonotonic Reasoning , 2000 .

[9]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[10]  Joost Vennekens,et al.  Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions , 2007, LPNMR.

[11]  Gabriel M. Kuper,et al.  Updating Logical Databases , 1986, Adv. Comput. Res..

[12]  Victor W. Marek,et al.  Uniform semantic treatment of default and autoepistemic logics , 2000, Artif. Intell..

[13]  Teodor C. Przymusinski,et al.  Update by Means of Inference Rules , 1997, J. Log. Program..

[14]  Miroslaw Truszczynski,et al.  Active integrity constraints and revision programming , 2010, Theory and Practice of Logic Programming.

[15]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[16]  Luís Cruz-Filipe,et al.  Fixpoint semantics for active integrity constraints , 2018, Artif. Intell..

[17]  Joost Vennekens,et al.  Safe inductions and their applications in knowledge representation , 2018, Artif. Intell..

[18]  Stephen Cole Kleene,et al.  On notation for ordinal numbers , 1938, Journal of Symbolic Logic.

[19]  Hannes Strass.  Approximating operators and semantics for abstract dialectical frameworks , 2013, Artif. Intell..

[20]  Luís Cruz-Filipe,et al.  Grounded Fixpoints and Active Integrity Constraints , 2016, ICLP.

[21]  Joost Vennekens,et al.  Splitting an operator: Algebraic modularity results for logics with fixpoint semantics , 2006, TOCL.

[22]  Luís Cruz-Filipe,et al.  Computing Repairs from Active Integrity Constraints , 2013, 2013 International Symposium on Theoretical Aspects of Software Engineering.

[23]  Marianne Winslett,et al.  Updating logical databases , 1990, Cambridge tracts in theoretical computer science.

[24]  Thomas Eiter,et al.  Hex Semantics via Approximation Fixpoint Theory , 2013, LPNMR.

[25]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[26]  Sergio Greco,et al.  Declarative Semantics of Production Rules for Integrity Maintenance , 2006, ICLP.

[27]  Peter Schneider-Kamp,et al.  repAIrC: A Tool for Ensuring Data Consistency , 2015, KMIS.

[28]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[29]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[30]  Maurice Bruynooghe,et al.  Well-founded and stable semantics of logic programs with aggregates , 2007, Theory Pract. Log. Program..

[31]  Hannes Strass,et al.  Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory , 2015, Artif. Intell..

[32]  Victor W. Marek,et al.  Ultimate approximation and its application in nonmonotonic knowledge representation systems , 2004, Inf. Comput..

[33]  Bertram Ludäscher,et al.  Understanding the global semantics of referential actions using logic rules , 2002, TODS.

[34]  Antoni Olivé,et al.  Updating knowledge bases while maintaining their consistency , 1995, The VLDB Journal.

[35]  Sergio Greco,et al.  Active integrity constraints , 2004, PPDP '04.

[36]  Joseph Y. Halpern,et al.  Towards a Theory of Knowledge and Ignorance: Preliminary Report , 1989, NMR.

[37]  Fangfang Liu,et al.  Flexible Approximators for Approximating Fixpoint Theory , 2016, Canadian Conference on AI.

[38]  Serge Abiteboul,et al.  Updates, A New Frontier , 1988, ICDT.

[39]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[40]  Joost Vennekens,et al.  Grounded fixpoints and their applications in knowledge representation , 2015, Artif. Intell..

[41]  Bart Bogaerts.  Groundedness in Logics With a Fixpoint Semantics , 2015 .

[42]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..

[43]  Luís Cruz-Filipe.  Optimizing Computation of Repairs from Active Integrity Constraints , 2014, FoIKS.

[44]  Jennifer Widom,et al.  Active Database Systems: Triggers and Rules For Advanced Database Processing , 1994 .

[45]  Joost Vennekens,et al.  On Well-Founded Set-Inductions and Locally Monotone Operators , 2016, TOCL.

[46]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[47]  Miroslaw Truszczynski,et al.  Strong and uniform equivalence of nonmonotonic theories – an algebraic approach , 2006, Annals of Mathematics and Artificial Intelligence.

[48]  Maurice Bruynooghe,et al.  Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs , 2012, Correct Reasoning.