Single elementary associative-commutative matching

DOI10.1023/A:1020122610698zbMath0993.68049OpenAlexW1546125953MaRDI QIDQ1598445

Steven Eker

Publication date: 22 May 2002

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020122610698

zbMATH Keywords

matching problemposet searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Grammars and rewriting systems (68Q42)

Related Items (5)

On the Parameterized Complexity of Associative and Commutative Unification ⋮ Variadic equational matching in associative and commutative theories ⋮ On the parameterized complexity of associative and commutative unification ⋮ Tactics for Reasoning Modulo AC in Coq ⋮ Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*

This page was built for publication: Single elementary associative-commutative matching