Equational unification, word unification, and 2nd-order equational unification
From MaRDI portal
Publication:1129255
DOI10.1016/S0304-3975(97)00130-8zbMath0902.68093MaRDI QIDQ1129255
Paliath Narendran, Friedrich Otto, Daniel J. Dougherty
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
term-rewriting systems2nd-order equational matching and unificationequational matching and unificationstring-rewriting systems
Cites Work
- Matching - a special case of unification?
- Decidable sentences of Church-Rosser congruences
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
- On two problems related to cancellativity
- A unification algorithm for second-order monadic terms
- The undecidability of the second-order unification problem
- Linear unification
- Unification in the union of disjoint equational theories: Combining decision procedures
- Two-Processor Scheduling with Start-Times and Deadlines
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent
- Some independence results for equational unification
- A Machine-Oriented Logic Based on the Resolution Principle
- Makanin's algorithm for word equations-two improvements and a generalization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Equational unification, word unification, and 2nd-order equational unification
