On unification of terms with integer exponents

DOI10.1007/BF01294596zbMath0815.68037OpenAlexW2043674238MaRDI QIDQ4327380

Hubert Comon

Publication date: 5 April 1995

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01294596

zbMATH Keywords

unification algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic programming (68N17)

Related Items (8)

The first order theory of primal grammars is decidable ⋮ Linear pattern matching of compressed terms and polynomial rewriting ⋮ Unification of infinite sets of terms schematized by primal grammars ⋮ Simplified handling of iterated term schemata ⋮ Perfect Discrimination Graphs: Indexing Terms with Integer Exponents ⋮ Primal grammars and unification modulo a binary clause ⋮ Context unification with one context variable ⋮ A complete superposition calculus for primal grammars

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On unification of terms with integer exponents