Automating proofs of integrity constraints in situation calculus

Leopoldo Bertossi, Javier Pinto, Pablo Saez, Deepak Kapur, Mahadevan Subramaniam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Abstract

Automated support for proving integrity constraints (ICs) on deductive database update specifications is developed using an induction theorem prover, Rewrite Rule Laboratory (RRL) [6]. The approach proposed by Reiter [9, 11,-10] for solving the frame problem for such applications in a language of the situation calculus is used as a basic framework. Integrity constraints are propositions that are expected to be true in every accessible state of a database, and they should be provable from the specification of the evolution of the database. Accessible states are defined by induction [12] as those reachable from the initial state by update actions whose execution is possible. Induction theorem provers can only reason about quantifier-free formulas (i.e., universally quantified formulas) whereas in order to express integrity constraints, quantifiers may be used. It is shown that by making use of the fact that in relational data base.applications, domain of objects under consideration is finite, such ICs expressed using quantifiers can be mechanically translated into quantifier-free formulas by introducing new predicates and by explicitly building domains of objects involved in updates. Bridge lemmas connecting the semantics of the new predicates to the fluents used to express integrity constraints can be mechanically generated and automatically proved in RRL. An interesting feature of the proposed approach is that mechanically generated proofs of integrity constraints have a structure similar to manually-generated proofs.

Original languageEnglish (US)
Title of host publicationFoundations of Intelligent Systems - 9th International Symposium, ISMIS 1996, Proceedings
EditorsZbigniew W. Ras, Maciek Michalewicz
PublisherSpringer Verlag
Pages212-222
Number of pages11
ISBN (Print)9783540612865
DOIs
StatePublished - 1996
Event9th International Symposium on Methodologies for Intelligent Systems, ISMIS 1996 - Zakopane, Poland
Duration: Jun 9 1996Jun 13 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1079
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Symposium on Methodologies for Intelligent Systems, ISMIS 1996
CountryPoland
CityZakopane
Period6/9/966/13/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Automating proofs of integrity constraints in situation calculus'. Together they form a unique fingerprint.

  • Cite this

    Bertossi, L., Pinto, J., Saez, P., Kapur, D., & Subramaniam, M. (1996). Automating proofs of integrity constraints in situation calculus. In Z. W. Ras, & M. Michalewicz (Eds.), Foundations of Intelligent Systems - 9th International Symposium, ISMIS 1996, Proceedings (pp. 212-222). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1079). Springer Verlag. https://doi.org/10.1007/3-540-61286-6_146