Associative-commutative discrimination nets

DOI10.1007/3-540-56610-4_56MaRDI QIDQ5044725zbMATH OpenOpenAlexFDO

Authors Leo Bachmair, Ta Chen, I. V. Ramakrishnan

Publication date 2 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56610-4_56

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Single elementary associative-commutative matching
• scientific article; zbMATH DE number 2043518
• Some complexity theoretic aspects of AC rewriting
• Termination and completion modulo associativity, commutativity and identity
• Complexity of matching problems

Cites work

• Adaptive pattern matching
• Complexity of matching problems
• scientific article; zbMATH DE number 1638660 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• Left-to-right tree pattern matching
• Tight complexity bounds for term matching problems

Cited in

(6)

• ELAN from a rewriting logic point of view
• Nonlinear pattern matching in rule-based modeling languages
• Path indexing for AC-theories
• Substitution tree indexing
• Extended path-indexing
• ILP :- Just Trie It

This page was built for publication: Associative-commutative discrimination nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044725)