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 …

Induction plays a key role in reasoning in many areas of mathematics and computer science.
A central problem in the automation of proof by induction is the non-analytic nature of …

This paper presents new results on the decidability of inductive validity of conjectures. For
these results, a class of term rewrite systems (TRSs) with built-in linear integer arithmetic is …

In first-order logic, the formula-based instances of the Noetherian induction principle allow to
perform effectively simultaneous, mutual and lazy induction reasoning. Compared to the …

Les systèmes collaboratifs sont utilisés pour former un groupe de personnes réparti dans le
temps, l'espace et à travers des organisations [27]. Ces personnes collaborent ensemble le …

SPIKE, an induction-based theorem prover built to reason on conditional theories with
equality, is one of the few formal tools able to perform automatically mutual and lazy …

(Automated) Inductive Theorem Proving (ITP) is a challenging field in automated reasoning
and theorem proving. Typically,(Automated) Theorem Proving (TP) refers to methods …

In this survey on implicit induction I recollect some memories on the history of implicit
induction as it is relevant for future research on computer-assisted theorem proving, esp …

In this paper, we propose methods for proving termination of constrained term rewriting
systems, where constraints are interpreted by built-in semantics given by users, and rewrite …

Automated inductive reasoning for term rewriting has been extensively studied in the
literature. Classes of equations and term rewriting systems (TRSs) with decidable inductive …