Mathematical induction is a powerful proof technique that is generally used to prove
statements involving whole numbers. Students often first encounter this technique in first or …

We propose a new procedure for proof by induction in conditional theories where case
analysis is simulated by term rewriting. This technique reduces considerably the number of …

Distributed groupware systems provide computer support for manipulating objects such as a
text document or a filesystem, shared by two or more geographically separated users. Data …

In this paper, a low-feedback-sampling-rate digital predistortion (DPD) method is proposed
for wideband wireless transmitters and radio-frequency power amplifiers (PAs). This DPD …

Test set induction is a goal-directed proof technique which combines the full power of
explicit induction and proof by consistency. It works by computing an appropriate explicit …

Cover set induction is known as a proof method that keeps the advantages of explicit
induction and proof by consistency. Most implicit induction proof procedures are defined in a …

SPIKE is a general system, fully automated, for theorem proving in theories described by a
set of clauses with equality. SPIKE stresses the use of simplification and subsumption, which …

Induction is a powerful proof technique adapted to reason on sets with an unbounded
number of elements. In a first-order setting, two different methods are distinguished: the …

Ground confluence of term rewriting systems guarantees that all ground terms are confluent.
Recently, interests in proving confluence of term rewriting systems automatically has grown …

Grâce à une expérimentation, cette recherche étudie les effets non conscients du
parrainage de deux programmes quasi identiques, mais de valences affectives différentes …