### Abstract

Original language | Undefined |
---|---|

Pages (from-to) | 27-70 |

Number of pages | 44 |

Journal | Journal of logic and computation |

Volume | 5 |

Issue number | 1 |

DOIs | |

Publication status | Published - Feb 1995 |

### Keywords

- EWI-10652
- active updates
- Dynamic Logic
- SCS-Services
- database updates

### Cite this

*Journal of logic and computation*,

*5*(1), 27-70. https://doi.org/10.1093/logcom/5.1.27

}

*Journal of logic and computation*, vol. 5, no. 1, pp. 27-70. https://doi.org/10.1093/logcom/5.1.27

**Aziomatization, Declarative Semantics and Operational Semantics of Passive and Active Updates in Logic Databases.** / Spruit, P.A.; Wieringa, Roelf J.; Meyer, J.J.C.

Research output: Contribution to journal › Article › Academic › peer-review

TY - JOUR

T1 - Aziomatization, Declarative Semantics and Operational Semantics of Passive and Active Updates in Logic Databases

AU - Spruit, P.A.

AU - Wieringa, Roelf J.

AU - Meyer, J.J.C.

PY - 1995/2

Y1 - 1995/2

N2 - The use of logic in database theory is commonly restricted to the specification of database states. Reasoning about state changes (the database updates) must then be done outside the logic. In this report, we consider a logic that also takes the updates into account. Taking propostional dynamic logic as a starting point, we define PDDL: prepositional dynamic database logic. The main features of PDDL are: •There are two kinds of atomic updates in PDDL, passive and active updates. Passive updates just change the truth value of an atom to true/false and active updates set one atom to true/false and then compute derived updates using a logic program. Just like the atomic actions of dynamic logic, the atomic updates can be combined into update programs with the operators sequential composition, choice and iteration. We have one more update action (also present in dynamic logic): the test of a formula. •The declarative semantics for formulas and updates, is based on Kripke structures. Because of the specific language of updates, we have many properties of the semantics that are not present in propositional dynamic logic (PDL). One of these properties is that we can identify worlds with the same valuation in a structure, the resulting structure is called normalized, and it is equivalent to the original structure. •We have a proof system for PDDL which is soundand complete for the class of ‘full’ structures. For non-full structures, the main problem is the axiomatization of successor worlds. For the most interesting class of (non-full) structures given some set of constraints, we give a reduction of the non-full case to the full case. •We have a Plotkin-style operational semantics for update programs. The operational semantics allows us to compute the result of executing an update in some database state. A database state is a set of (propositional) formulas and specifies some subset of the worlds in a structure (the worlds in whichs the database state is true). The operational and declarative semantics are shown to be equivalent.

AB - The use of logic in database theory is commonly restricted to the specification of database states. Reasoning about state changes (the database updates) must then be done outside the logic. In this report, we consider a logic that also takes the updates into account. Taking propostional dynamic logic as a starting point, we define PDDL: prepositional dynamic database logic. The main features of PDDL are: •There are two kinds of atomic updates in PDDL, passive and active updates. Passive updates just change the truth value of an atom to true/false and active updates set one atom to true/false and then compute derived updates using a logic program. Just like the atomic actions of dynamic logic, the atomic updates can be combined into update programs with the operators sequential composition, choice and iteration. We have one more update action (also present in dynamic logic): the test of a formula. •The declarative semantics for formulas and updates, is based on Kripke structures. Because of the specific language of updates, we have many properties of the semantics that are not present in propositional dynamic logic (PDL). One of these properties is that we can identify worlds with the same valuation in a structure, the resulting structure is called normalized, and it is equivalent to the original structure. •We have a proof system for PDDL which is soundand complete for the class of ‘full’ structures. For non-full structures, the main problem is the axiomatization of successor worlds. For the most interesting class of (non-full) structures given some set of constraints, we give a reduction of the non-full case to the full case. •We have a Plotkin-style operational semantics for update programs. The operational semantics allows us to compute the result of executing an update in some database state. A database state is a set of (propositional) formulas and specifies some subset of the worlds in a structure (the worlds in whichs the database state is true). The operational and declarative semantics are shown to be equivalent.

KW - EWI-10652

KW - active updates

KW - Dynamic Logic

KW - SCS-Services

KW - database updates

U2 - 10.1093/logcom/5.1.27

DO - 10.1093/logcom/5.1.27

M3 - Article

VL - 5

SP - 27

EP - 70

JO - Journal of logic and computation

JF - Journal of logic and computation

SN - 0955-792X

IS - 1

ER -