Single elementary associative-commutative matching
From MaRDI portal
Publication:1598445
DOI10.1023/A:1020122610698zbMATH Open0993.68049OpenAlexW1546125953MaRDI QIDQ1598445FDOQ1598445
Authors: 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
Recommendations
Cited In (15)
- Order-sorted homeomorphic embedding modulo combinations of associativity and/or commutativity axioms
- On the parameterized complexity of associative and commutative unification
- On the parameterized complexity of associative and commutative unification
- Title not available (Why is that?)
- Variadic equational matching in associative and commutative theories
- Variadic equational matching
- The complexity of counting problems in equational matching
- Tactics for Reasoning Modulo AC in Coq
- Title not available (Why is that?)
- Single-crossing choice correspondences
- Associative-commutative discrimination nets
- Title not available (Why is that?)
- Some complexity theoretic aspects of AC rewriting
- Rewriting Techniques and Applications
- Title not available (Why is that?)
This page was built for publication: Single elementary associative-commutative matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598445)