AC-unification race: The system solving approach, implementation and benchmarks

DOI10.1016/0747-7171(92)90025-YzbMath0769.68053MaRDI QIDQ1199708

Claude Kirchner, Mohamed Adi

Publication date: 16 January 1993

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

specificationprogramAssociative-Commutative unification algorithmimplementation in Csolving systems of equations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (4)

Modular AC unification of higher-order patterns ⋮ “Syntactic” AC-unification ⋮ On computing Hilbert bases via the Elliot--MacMahon algorithm ⋮ Equational rules for rewriting logic

Uses Software

• ORME

Cites Work

• Non-negative integer basis algorithms for linear equations with integer coefficients
• Unification in abelian semigroups
• Algebraic and logic programming. Second international conference, Nancy, France, October 1--3, 1990. Proceedings
• An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
• Competing for the \(AC\)-unification race
• On equational theories, unification, and (un)decidability
• A Unification Algorithm for Associative-Commutative Functions
• Minimal solutions of linear diophantine systems : bounds and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: AC-unification race: The system solving approach, implementation and benchmarks