Flat matching

DOI10.1016/J.JSC.2008.05.001zbMath1152.68059OpenAlexW2912446835WikidataQ56211738 ScholiaQ56211738MaRDI QIDQ999086

Temur Kutsia

Publication date: 30 January 2009

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

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

zbMATH Keywords

matchingMathematicaflat theoriessequence variables

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (3)

Anti-patterns for rule-based languages ⋮ Variadic equational matching in associative and commutative theories ⋮ Anti-unification for unranked terms and hedges

Uses Software

• Mathematica
• Theorema
• Veriflog
• CLP(Flex)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \textit{Theorema}: Towards computer-aided mathematical theory exploration
• A review of Mathematica
• Word unification and transformation of generalized equations
• Solvability of context equations with two context variables is decidable
• The complexity of linear and stratified context matching problems
• A tight, practical integration of relations and functions.
• The meaning of infinity in calculus and computer algebra systems
• Minimal and complete word unification
• Foundations of the rule-based system ρLog
• Foundations of Information and Knowledge Systems

This page was built for publication: Flat matching