Although different satisfiability decision procedures can be combined by algorithms such as
those of Nelson–Oppen or Shostak, current tools typically can only support a finite number of …

Reachability logic has been applied to K rewrite-rule-based language definitions as a
language-generic logic of programs. To be able to verify not just code but also distributed …

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 …

Reachability logic has been applied to 𝕂 rewrite-rule-based language definitions as a
language-generic logic of programs to verify a wide range of sophisticated programs in …

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 …

In the present paper, we address the following general question in the framework of
classical first-order logic. Assume that a certain mathematical principle can be formalized in …

We present a framework for proving inductive theorems of first-order equational theories,
using techniques of implicit induction developed in the field of term rewriting. In this …

As computer system complexity increases, new methods and logics are needed to scale up
to the complexity of practical systems without sacrificing logical precision and ease of …

Although different satisfiability decision procedures can be combined by algorithms such as
those of Nelson-Oppen or Shostak, current tools typically can only support a finite number of …

抄録 帰納的定理は項書き換えシステム (TRS) における重要な特徴付けの一つであり,
帰納的妥当性は条件付き項書き換えシステム (CTRS) においても自然に定義される …