Information Systems
IEEE Transactions on Software Engineering
Maintaining state constraints in relational databases: a proof theoretic basis
Journal of the ACM (JACM)
A theorem-proving approach to database integrity
Foundations of deductive databases and logic programming
Integrity = validity + completeness
ACM Transactions on Database Systems (TODS)
Reactive consistency control in deductive databases
ACM Transactions on Database Systems (TODS)
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Queries = examples + counterexamples
Information Systems
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Finite Differencing of Computable Expressions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Constraint Analysis: A Design Process for Specifying Operations on Objects
IEEE Transactions on Knowledge and Data Engineering
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
ICIS '97 Proceedings of the eighteenth international conference on Information systems
Database audit and control strategies
Information Technology and Management
Transaction Repair for Integrity Enforcement
IEEE Transactions on Knowledge and Data Engineering
Exploring into Programs for the Recovery of Data Dependencies Designed
IEEE Transactions on Knowledge and Data Engineering
Automated elicitation of inclusion dependencies from the source code for database transactions
Journal of Software Maintenance: Research and Practice
Predicalc: A logical spreadsheet management system
The Knowledge Engineering Review
Hi-index | 0.00 |
A differential calculus for first-order logic is developed to enforce database integrity. Formal differentiation of first-order sentences is useful in maintaining database integrity, since once a database constraint is expressed as a first-order sentence, its derivative with respect to a transaction provides the necessary and sufficient condition for maintaining integrity. The derivative is often much simpler to test than the original constraint since it maintains integrity differentially by assuming integrity before the transaction, and testing only for new violations. The formal differentiation requires no resolution search, but only substitution. It is more efficient than resolution-based approaches; and it provides a considerably more general solution than previous substitution-based methods since it is valid for all first-order sentences and with all transactions involving arbitrary collections of atomic changes to the database. It also produces a large number of sufficient conditions that are often less strict than those of the previous approaches; and it can be extended to accommodate many dynamic constraints.