On the relation between context and sequence unification

DOI10.1016/j.jsc.2009.07.001zbMath1194.68224MaRDI QIDQ1034550

Temur Kutsia, Jordi Levy, Mateu Villaret

Publication date: 6 November 2009

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

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

zbMATH Keywords

context unification; sequence unification; word unification

Mathematics Subject Classification ID

68T30: Knowledge representation

68Q42: Grammars and rewriting systems

Related Items

Regular expression order-sorted unification and matching, 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
• Unnamed Item
• Unnamed Item
• \textit{Theorema}: Towards computer-aided mathematical theory exploration
• The complexity of linear and stratified context matching problems
• A tight, practical integration of relations and functions.
• Solving equations with sequence variables and sequence functions
• Minimal and complete word unification
• Foundations of the rule-based system ρLog
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Complexity of Makanin's algorithm
• A Decision Algorithm for Stratified Context Unification
• Linear second-order unification
• Matching with Regular Constraints
• Automated Deduction – CADE-20
• Sequence Unification Through Currying
• Logical Aspects of Computational Linguistics
• Makanin's algorithm for word equations-two improvements and a generalization