Variadic equational matching in associative and commutative theories

DOI10.1016/j.jsc.2021.01.001OpenAlexW3121945794MaRDI QIDQ2029000

Besik Dundua, Temur Kutsia, Mircea Marin

Publication date: 3 June 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2021.01.001

zbMATH Keywords

Mathematicapattern matchingequational theoriesvariadic symbols

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Uses Software

• Mathematica
• Theorema
• Maude
• XCentric
• CLP(Flex)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular expression order-sorted unification and matching
• \textit{Theorema}: Towards computer-aided mathematical theory exploration
• Anti-patterns for rule-based languages
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Flat matching
• Complexity of matching problems
• Unification theory
• Rewriting techniques and applications. 14th international conference, RTA 2003, Valencia, Spain, June 9--11, 2003. Proceedings
• Single elementary associative-commutative matching
• Complete sets of unifiers and matchers in equational theories
• Variadic equational matching
• Solving equations with sequence variables and sequence functions
• Regular expression pattern matching for XML
• Foundations of the rule-based system ρLog
• Proving termination with multiset orderings
• CLP(H):Constraint logic programming for hedges
• The complexity of satisfiability problems
• Artificial Intelligence and Symbolic Computation
• Flexary Operators for Formalized Mathematics

This page was built for publication: Variadic equational matching in associative and commutative theories