Ordered chaining for total orderings

Abstract

We design new inference systems for total orderings by applying rewrite techniques to chaining calculi. Equality relations may either be specified axiomatically or built into the deductive calculus via paramodulation or superposition. We demonstrate that our inference systems are compatible with a concept of (global) redundancy for clauses and inferences that covers such widely used simplification techniques as tautology deletion, subsumption, and demodulation. A key to the practicality of chaining techniques is the extent to which so-called variable chainings can be restricted. Syntactic ordering restrictions on terms and the rewrite techniques which account for their completeness considerably restrict variable chaining. We show that variable elimination is an admissible simplification techniques within our redundancy framework, and that consequently for dense total orderings without endpoints no variable chaining is needed at all.

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.…”

“…The inference system is not yet sufficiently restrictive for efficient proof search. We follow [13] and add conditions to the rules that refer to some complete reduction order # (on the set of all terms). We write Remark 32.…”

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

A Resolution Procedure for Description Logics with Nominal Schemas

“…{z} ∃hasP arent.∃married. {z} C (2) The expression {z} in (2) is a nominal schema, which is a variable that only binds with known individuals in a knowledge base and the binding is the same for all occurrences of the same nominal schema in an axiom.…”