The Ramification and Qualification Problems in Temporal Databases

The ramification and qualification problems are two infamous, hard and ever present problems in databases and, more generally, in systems exhibiting a dynamic behavior. The ramification problem refers to determining the indirect effects of actions, whereas the qualification problem refers to determining the preconditions which must hold prior to the execution of an action. A solution to these problems in database systems permits reasoning about the dynamics of databases and allows proving consistency properties. These two problems become increasingly complex in temporal databases and no satisfactory solution has been proposed as of yet. In this paper, we describe these two problems in the context of temporal databases and we propose a solution of polynomial complexity based on the language of the Situation Calculus. This solution extends previous proposals for the solution of these problems in conventional (non-temporal) databases.

[1]  Hudson Turner,et al.  A Causal Theory of Ramifications and Qualifications , 1995, IJCAI.

[2]  Raymond Reiter,et al.  Temporal Reasoning in Logic Programming: A Case for the Situation Calculus , 1993, ICLP.

[3]  R. Reiter,et al.  Temporal reasoning in the situation calculus , 1994 .

[4]  Michael Thielscher.  Qualified Ramifications , 1997, AAAI/IAAI.

[5]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

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

[7]  Michael Thielscher,et al.  Reasoning About Actions: Steady Versus Stabilizing State Constraints , 1998, Artif. Intell..

[8]  Joakim Gustafsson.  Extending temporal action logic for ramification and concurrency , 1998 .

[9]  John Mylopoulos,et al.  Accomodating Integrity Constraints During Database Design , 1996, EDBT.

[10]  A. Haas.  The Case for Domain-Specific Frame Axioms , 1987 .

[11]  Michael Thielscher,et al.  Ramification and Causality , 1997, Artif. Intell..

[12]  Michael Thielscher,et al.  Nondeterministic Actions in the Fluent Calculus: Disjunctive State Update Axioms , 2000, Intellectics and Computational Logic.

[13]  David E. Smith,et al.  Reasoning About Action I: A Possible Worlds Approach , 1987, Artif. Intell..

[14]  Michael Thielscher,et al.  Ramiication and Causality , 1996 .

[15]  Vladimir Lifschitz,et al.  Restricted Monotonicity , 1993, AAAI.

[16]  Charles Elkan,et al.  Reasoning about Action in First-Order Logic , 1992 .

[17]  Akira Fusaoka.  Situation Calculus on a Dense Flow of Time , 1996, AAAI/IAAI, Vol. 1.

[18]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[19]  David E. Smith,et al.  Reasoning About Action II: The Qualification Problem , 1988, Artif. Intell..

[20]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[21]  Nikos Papadakis,et al.  Action Theories in Temporal Databases , 2002 .

[22]  John Mylopoulos,et al.  On the Frame Problem in Procedure Specifications , 1995, IEEE Trans. Software Eng..

[23]  Vladimir Lifschitz,et al.  Frames in the Space of Situations , 1990, Artif. Intell..

[24]  Raymond Reiter,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2001 .