We propose a method for integrity checking in the context of temporal deductive databases. A temporal deductive database is a deductive database that supports some aspect of time, in our case valid time, in which valid time is the time when the fact is true in the modelled reality. Our method augments a database with a set of transition and event rules, which explicitly define the insertions an...

Known methods for checking integrity constraints in deductive databases do not eliminate all aspects of redundancy in integrity checking. By making the redundancy aspects of integrity constraint checking explicit, independently from any chosen method, it is possible to develop a new method that is optimal with respect to the classiied redundancy aspects. We distinguish three types of redundancy...

This paper introduces and studies a declarative framework for updating views over indefinite databases. An indefinite database is a database with null values that are represented, following the standard database approach, by a single null constant. The paper formalizes views over such databases as indefinite deductive databases, and defines for them several classes of database repairs that real...

We exploit the spreadsheet metaphor to make deductive problem-solving methods available to the vast population of spreadsheet end users. In particular, we show how the function-based problem-solving capabilities of spreadsheets can be extended to include logical deductive methods in a way that is consistent with the existing spreadsheet “look and feel.” The foundation of our approach is the int...

In this paper, we address one important aspect of the problem of designing a cooperative deductive database system, namely, allocation of rules across the deductive database systems. We identify communication cost as the primary consideration in allocation of rules. The problem of optimal allocation of rules has been shown NP-complete, which has prohibitive execution times for large knowledge b...

We de ne a preferential semantics based on stable generated models for a very general class of temporal deductive databases. We allow two kinds of temporal information to be represented and queried: timepoint and timestamp formulas, and show how each of them can be translated into the other. Because of their generality, our formalism and our semantics can serve as a basis for comparing and exte...