A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
The structure of the relational database model
The structure of the relational database model
The design of relational databases
The design of relational databases
Relational database theory
Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation
Information and Computation
Determining View dependencies using tableaux
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
On the family of generalized dependency constraints
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Basic Paramodulation and Superposition
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Towards automatic generation of semantic types in scientific workflows
WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
A calculus for propagating semantic annotations through scientific workflow queries
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
| Hi-index | 0.00 |
Chase procedures are well-known decision and semi-decision procedures for the implication problem among dependencies, a specific type of first-order logic formulas, that are used for expressing database constraints. Of course, the implication problem can also be treated by general refutationally complete inference systems, like resolution with paramodulation. Recently the inference rule of basic paramodulation has been introduced and investigated as a strategy for exploring the search space for a refutation most efficiently. This paper demonstrates that chase procedures can be seen as special instances of basic paramodulation by defining the parameters of basic paramodulation, a reduction ordering and a term selection function, appropriately. The mutual simulation of chase procedures and basic paramodulation also extends to the completeness proofs.