Matching with multiplication and exponentiation (extended abstract)

Authors:
Bernard Lang
Affiliations:
IRIA – Laboria, Domaine de Voluceau, Rocquencourt, 78150 LE CHESNAY, France
Venue:
Mathematical Structures in Computer Science
Year:
2005

Citing 3
Cited 0

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

Journal of the ACM (JACM)
Linear unification

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a matching algorithm for an equational theory with multiplication, exponentiation and a unit element. The algorithm is proved consistent, complete and minimal using techniques based on initial algebras.