Declarative semantics for active rules

In this paper we analyze declarative deterministic semantics for active rules. In particular we consider deterministic (partial) stable model semantics previously defined for deductive rules such as well-founded, max-deterministic, and unique total stable semantics. The semantics of an active program \(\mathcal{A}\mathcal{P}\)is given by first rewriting it into a deductive program \(\mathcal{L}\mathcal{P}\), computing the model M defining the declarative semantics of \(\mathcal{L}\mathcal{P}\)and, finally, applying ‘consistent’ updates contained in M to the source database.

[1]  Sofian Maabout,et al.  A Model Theoretic Approach to Update Rule Programs , 1997, ICDT.

[2]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[3]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[4]  Carlo Zaniolo,et al.  Deterministic and Non-Deterministic Stable Models , 1997, J. Log. Comput..

[5]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

[6]  Jorge Lobo,et al.  Formal Characterization of Active Databases , 1996, Logic in Databases.

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

[8]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[9]  Jennifer Widom.  Deductive and Active Databases: Two Paradigms or Ends of a Spectrum? , 1993, Rules in Database Systems.

[10]  Jennifer Widom,et al.  An Algebraic Approach to Rule Analysis in Expert Database Systems , 1994, VLDB.

[11]  Carlo Zaniolo.  Active Database Rules with Transaction-Conscious Stable-Model Semantics , 1995, DOOD.

[12]  Victor Vianu,et al.  Semantics and Expressiveness Issues in Active Databases , 1998, J. Comput. Syst. Sci..

[13]  Sergio Greco,et al.  DATALOG Queries with Stratified Negation and Choice: from P to DP , 1995, ICDT.

[14]  Bertram Ludäscher.  Integration of Active and Deductive Database Rules , 1998, DISDBIS.

[15]  Jennifer Widom,et al.  A denotational semantics for the Starburst production rule language , 1992, SGMD.

[16]  Sergio Greco,et al.  Deterministic Semantics for Datalog¬: Complexity and Expressive Power , 1997, DOOD.

[17]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[18]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[19]  Danny De Schreye,et al.  Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..

[20]  Jennifer Widom,et al.  Behavior of database production rules: termination, confluence, and observable determinism , 1992, SIGMOD '92.

[21]  Victor Vianu,et al.  Semantics and expressiveness issues in active databases (extended abstract) , 1995, PODS '95.

[22]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[23]  Hector J. Levesque,et al.  Logical foundations of active databases , 2003 .

[24]  Abraham Silberschatz,et al.  Safety of recursive Horn clauses with infinite relations , 1987, PODS '87.

[25]  R. Ramakrishnan,et al.  A framework for testing safety and effective computability of extended datalog , 1988, SIGMOD '88.

[26]  Stefano Ceri,et al.  The Story of the IDEA Methodology , 1997, CAiSE.

[27]  Serge Abiteboul,et al.  Non-deterministic languages to express deterministic transformations , 1990, PODS '90.

[28]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.

[29]  Phokion G. Kolaitis.  Implicit definability on finite structures and unambiguous computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[30]  Elena Baralis,et al.  Improving Rule Analysis by Means of Triggering and Activation Graphs , 1995, Rules in Database Systems.

[31]  Yehoshua Sagiv,et al.  Safety of datalog queries over infinite databases , 1989, PODS '89.

[32]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[33]  Lobel Crnogorac,et al.  Abstract Interpretation of Active Rules and its Use in Termination Analysis , 1997, ICDT.

[34]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

[35]  Andreas Blass,et al.  On the Unique Satisfiability Problem , 1982, Inf. Control..

[36]  Sergio Greco,et al.  The Expressive Power of Unique Total Stable Model Semantics , 1997, ICALP.

[37]  Abraham Silberschatz,et al.  An axiomatic approach to deciding query safety in deductive databases , 1988, PODS '88.