HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Automated deduction with associative commutative operators

Michaël Rusinowitch 1 Laurent Vigneron 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 4:17:12 PM
Last modification on : Friday, February 4, 2022 - 3:34:45 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 7:19:45 PM


  • HAL Id : inria-00074775, version 1



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



Record views


Files downloads