Automated deduction with associative commutative operators - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

Automated deduction with associative commutative operators

Abstract

We propose a new inference system for automated deduction with equality and associative commutative operators. This system is an extension of the ordered paramodulation strategy. However, rather than using associativity and commutativity as the other axioms, they are handled by the AC-unification algorithm and the inference rules. Moreover, we prove the refutational completeness of this system without needing the functional reflexive axioms or AC-axioms. Such a result is obtained by semantic tree techniques. We also show that the inference system is compatible with simplification rules.
Fichier principal
Vignette du fichier
RR-1896.pdf (1.7 Mo) Télécharger le fichier

Dates and versions

inria-00074775 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074775 , version 1

Cite

Michaël Rusinowitch, Laurent Vigneron. Automated deduction with associative commutative operators. [Research Report] RR-1896, INRIA. 1993, pp.34. ⟨inria-00074775⟩
137 View
100 Download

Share

Gmail Facebook Twitter LinkedIn More