On the relation between context and sequence unification

DOI10.1016/J.JSC.2009.07.001MaRDI QIDQ1034550zbMATH OpenOpenAlexFDO

Authors 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 unificationsequence unificationword unification

Mathematics Subject Classification ID

Knowledge representation (68T30) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 3995082
• On the semantics of unification grammars
• Sequentiality of string-to-context transducers
• Unification and matching in hierarchical combinations of syntactic theories
• Automated Deduction – CADE-20
• Sequence graphs realizations and ambiguity in language models
• On Context-Tree Prediction of Individual Sequences
• Contextual generalized sequential machines
• Deciding context unification (with regular constraints)

Cites work

• scientific article; zbMATH DE number 1722705 (Why is no real title available?)
• scientific article; zbMATH DE number 1818845 (Why is no real title available?)
• scientific article; zbMATH DE number 1189059 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1332638 (Why is no real title available?)
• scientific article; zbMATH DE number 1980934 (Why is no real title available?)
• scientific article; zbMATH DE number 2090055 (Why is no real title available?)
• scientific article; zbMATH DE number 2090082 (Why is no real title available?)
• A Decision Algorithm for Stratified Context Unification
• A tight, practical integration of relations and functions.
• Automated Deduction – CADE-20
• Complexity of Makanin's algorithm
• Foundations of the rule-based system \(\rho\,\text{Log}\)
• Linear second-order unification
• Logical Aspects of Computational Linguistics
• Makanin's algorithm for word equations-two improvements and a generalization
• Matching with Regular Constraints
• Minimal and complete word unification
• Sequence Unification Through Currying
• Solving equations with sequence variables and sequence functions
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• The complexity of linear and stratified context matching problems
• \textit{Theorema}: Towards computer-aided mathematical theory exploration

Cited in

(5)

• Anti-unification for unranked terms and hedges
• Unranked Nominal Unification
• Sequence Unification Through Currying
• Regular expression order-sorted unification and matching
• Efficient Contextual Unfolding

Describes a project that uses

Uses Software

• CLP(Flex)
• Veriflog
• Theorema
• Mathematica

This page was built for publication: On the relation between context and sequence unification

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