A completion procedure for conditional equations
1st international workshop on Conditional Term Rewriting Systems
Evaluating general purpose automated theorem proving systems
Artificial Intelligence
Term Indexing
Otter - The CADE-13 Competition Incarnations
Journal of Automated Reasoning
Journal of Automated Reasoning
Unification in Extension of Shallow Equational Theories
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Saturation of First-Order (Constrained) Clauses with the Saturate System
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
On the Evaluation of Indexing Techniques for Theorem Proving
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Inductive Theorem Proving by Consistency for First-Order Clauses
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Implementing Contextual Rewriting
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Resolution decision procedures
Handbook of automated reasoning
Combining superposition, sorts and splitting
Handbook of automated reasoning
A Superposition Decision Procedure for the Guarded Fragment with Equality
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Sophisticated reductions are an important means to achieve progress in automated theorem proving. We consider the powerful reduction rule Contextual Rewriting in connection with the superposition calculus. If considered in its most general form the applicability of contextual rewriting is not decidable. We develop an instance of contextual rewriting where applicability becomes decidable while preserving a great deal of its simplification power. A sophisticated implementation of the rule in SPASS reveals its application potential. Our contextual rewriting instance called subterm contextual rewriting is feasible in the sense that it can be executed on the overall TPTP resulting in a gain of solved problems and new solutions to a number of problems that could not be solved by theorem provers so far.