The use of conditional rewrite rules has been investigated for a long time in the field of automated reasoning (see e.g. [Boyer & Moore 79], [Smith 85]).
May 27, 2005 · 'On the use of conditional rewrite rules in inductive theorem proving' published in 'Conditional Term Rewriting Systems'
The notion of conditional term rewriting systems that allows to simulate theories specified by conditional equations is presented.
Missing: Theorem Proving.
Nov 11, 2010 · A rewrite rule is said to have an equational condition when its condition does not contain any sequents. It is called unconditional when its ...
The condition is a key to automated proof of inductive theorems of term rewriting systems that include non-terminating functions. We also apply the technique to ...
Essentially, rewriting is used to simulate the behaviour of eqTlatiops on abstract algebras of terms. In that sense it allows to investigate mathematical ...
Directed equations, called "rewrite rules" , are used to replace equals by equals, but only in the indicated direction. The theory of rewriting centers around ...
May 19, 2006 · We have proposed a method for testing sufficient completeness of constrained and conditional rewrite systems with constrained rules for ...
This work presents an approach that combines automated and explicit-induction theorem proving in the context of proving validity in the initial algebra TE of an ...
May 3, 2024 · Since in our inductive theorem proving applications both reductive conditional equations and usable equations will be induction hypotheses used.