Theorem Proving Techniques for View Deletion in Databases

  title={Theorem Proving Techniques for View Deletion in Databases},
  author={Chandrabose Aravindan and Peter Baumgartner},
  journal={J. Symb. Comput.},
In this paper, we show how techniques from first-order theorem proving can be used for efficient deductive database updates. The key idea is to transform the given database, together with the update request, into a (disjunctive) logic program and to apply the hyper-tableau calculus (Baumgartner et al. 1996) to solve the original update problem. The resulting algorithm has the following properties: it works goal-directed (i.e. the search is driven by the update request), it is rational in the… 
A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases
The approach extends and integrates standard techniques for efficient query answering and integrity checking (based on transformation techniques and fixpoint computation, too) and makes it potentially useful in the context of (commercial) SQL systems, too.
Techniques for optimized reasoning in description logic knowledge bases
This thesis focuses on the automated reasoning aspects of these problems and introduces three change operators interesting for these knowledge bases, namely deletion and insertion of assertions as well as repair of inconsistent instance bases.
Semantically Guided Evolution of SHI ABoxes
It is shown, that the ABox can be used for a semantically guided transformation resulting in an equisatisfiable knowledge base and the result of this transformation is used to effciently delete assertions from the ABbox.
Semantically Guided Evolution of $\mathcal{SHI}$ ABoxes
It is shown, that the ABox can be used for a semantically guided transformation resulting in an equisatisfiable knowledge base and the result of this transformation is used to efficiently delete assertions from theABox.
First-order logic Davis-Putnam-Logemann-Loveland procedure
The Davis-Putnam-Logemann-Loveland procedure (DPLL) was introduced in the early 1960s as a proof procedure for first-order logic. Nowadays, only its propositional logic core component is widely used
Algorithmic and Computational Complexity Issues of MONET
Several restricted classes of Monet are shown to be solvable in logarithmic space, which improves previously known polynomial time bounds and shows Monet to be in the complexity class of fixed-parameter tractable problems with respect to several parameters.
On First-Order Model-Based Reasoning
This paper surveys a selection of semantically-guided or model-based methods that aim at meeting aspects of this challenge of reasoning semantically in first-order logic, concluding with the recent Model-Constructing satisfiability calculus.
Resource-Adaptive Model Generation as a Performance Model
An extended model generation calculus is outlined that solves the most unpleasant com-putational inadequacy and is embedded into an abstract inferencemachine and illustrated by presenting a partial theory of definite descriptions in this setting.
Abducing Coreference by Model Construction
A semantic representation for utterances containing anaphora that enables us to compute possible antecedents by abductive inference and is applied to the resolution of anaphoric expressions in the general model constructing framework for incremental discourse representation.
Computational Space Efficiency and Minimal Model Generation for Guarded Formulae
A number of hyperresolution-based decision procedures for a subfragment of the guarded fragment based on hyperresolution, (complement) splitting and either model constraint propagation or local minimality tests are described.


A Rational and Efficient Algorithm for View Deletion in Databases
In this paper, we show how techniques from disjunctive logic program ming and classical first-order theorem proving can be used for efficient (deductive) database updates. The key idea is to tranform
Drawing Updates From Derivations
It is shown that an SLDNF tree provides for derivations from which a complete set of possible updates for a delete request can be drawn, and specifies a literal selection strategy that avoids the construction of redundant derivations.
Database Updates through Abduction
It is shown that this abductive approach deals successfully, in a simple yet powerful way, with the difficulties related to the presence of negation in the database and provides a uniform common procedure for insert and delete update requests.
A Tableau Calculus for Minimal Model Reasoning
The paper studies the automation of minimal model inference, i.e., determining whether a formula is true in every minimal model of the premises by employing a groundedness property of minimal models.
Automated Reasoning with Analytic Tableaux and Related Methods
  • R. Dyckhoff
  • Computer Science
    Lecture Notes in Computer Science
  • 2000
Tableau Algorithms for Description Logics and Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory.
View Update Translation via Deduction and Annotation
As an example of a method for reducing the number of possible translations of a view update, rule annotations are introduced and a small number of unique annotations is shown to produce unique translations of view updates.
Knowledge base dynamics, Abduction and Databases updates
It is shown that knowledge base dynamics has interesting connections with abduction, thus enabling us to use abductive procedures to realize contractions, and it is demonstrated howknowledge base dynamics can provide an axiomatic characterization for deleting view atoms from databases.
Hyper Tableaux The Next Generation
An improvement is introduced which removes the major weakness of the calculus, which is the need to (at least partially) blindly guess ground-instantiations for certain clauses, now replaced by a unification-driven technique.
Tableaux for Diagnosis Applications
This paper demonstrates how a system based on belief revision procedures and first order logic system descriptions can be rigorously formalized from the viewpoint of deduction by using the calculus of hyper tableaux in [NF96].
View updates in relational databases with an independent scheme
The view update translation problem for a relational data model in which the base relations may contain (indexed) nulls is studied and it is proven that the constant complement method of Bancilhon and Spyratos is too restrictive to be useful in this context.