Proc. of the first international conference on Rewriting techniques and applications
A new method for establishing refutational completeness in theorem proving
Proc. of the 8th international conference on Automated deduction
Simplifying conditional term rewriting systems: Unification, termination and confluence
Journal of Symbolic Computation
A completion procedure for conditional equations
1st international workshop on Conditional Term Rewriting Systems
Handbook of theoretical computer science (vol. B)
An Overview of Rewrite Rule Laboratory (RRL)
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Canonical Conditional Rewrite Systems
Proceedings of the 9th International Conference on Automated Deduction
First-Order Theorem Proving Using Conditional Rewrite Rules
Proceedings of the 9th International Conference on Automated Deduction
Reduction Techniques for First-Order Reasoning
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Conditional Rewriting in Focus
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
Reduction, superposition and induction: automated reasoning in an equational logic
Reduction, superposition and induction: automated reasoning in an equational logic
Automatic case analysis in proof by induction
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
The control layer in open mechanized reasoning systems: annotations and tactics
Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
A General Setting for Flexibly Combining and Augmenting Decision Procedures
Journal of Automated Reasoning
Incorporating decision procedures in implicit induction
Journal of Symbolic Computation - Integrated reasoning and algebra systems
Combining Generic and Domain Specific Reasoning by Using Contexts
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Constraint contextual rewriting
Journal of Symbolic Computation - Special issue: First order theorem proving
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Contextual rewriting as a generalization of conditional rewriting has been found in different forms in the papers whose major subject is not contextual rewriting. Here, we put the scattered information together and give it a systematic study. Among various properties of contextual rewriting, we show that contextual rewriting is a powerful simplification rule for the first-order theorem proving with equality and preserves the refutational completeness of many reasoning systems. We compare definitions of contextual rewriting by Boyer-Moore, Rémy, Zhang-Rémy, Ganzinger, Zhang-Kapur, and Bouhoula-Rusinowitch in regard to its efficiency and power. We provide a detailed procedure for simplifying clauses using contextual rewriting and a solution on how to handle variables which appear only in the condition of a conditional rewrite rule.