Ordered chaining calculi for first-order theories of transitive relations

Abstract

We propose inference systems for binary relations that satisfy composition laws such as transitivity. Our inference mechanisms are based on standard techniques from term rewriting and represent a refinement of chaining methods as they are used in the context of resolution-type theorem proving. We establish the refutational completeness of these calculi and prove that our methods are compatible with the usual simplification techniques employed in refutational theorem provers, such as subsumption or tautology deletion. Various optimizations of the basic chaining calculus will be discussed for theories with equality and for total orderings. A key to the practicality of chaining methods is the extent to which so-called variable chaining can be avoided. We demonstrate that rewrite techniques considerably restrict variable chaining and that further restrictions are possible if the transitive relation under consideration satisfies additional properties, such as symmetry. But we also show that variable chaining cannot be completely avoided in general.

Automated verification of refinement laws

“…From the ATP point of view, the integration of order-based reasoning [1,30] might drastically improve the performance on verification tasks that are strongly based on inequational reasoning, for instance with isotonicity. The example of refinement shows that automated reasoning with inequalities is perhaps more difficult, but surely not less interesting than its equational counterpart.…”

Sequent of Relations Calculi: A Framework for Analytic Deduction in Many-valued Logics

“…Efficient decision procedures for T ≤,< can be found, e.g., in [11,12]. These results, in particular, imply that T ≤,< fulfills condition (D) on semantic theories (i.e., decidability for Π 1 -formulas).…”

Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving

“…In particular, combinations of chaining and superposition along the line of [13,14] should be applied. The inference system is not yet sufficiently restrictive for efficient proof search.…”

“…We write Remark 32. Even more refined "chaining calculi" for handling orders have been defined by Bachmair and Ganzinger in [13,14]. However,…”