Equational unification, word unification, and 2nd-order equational unification

DOI10.1016/S0304-3975(97)00130-8MaRDI QIDQ1129255zbMATH OpenFDO

Authors Friedrich Otto, Paliath Narendran, Daniel J. Dougherty

Publication date 13 August 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(97)00130-8

zbMATH Keywords

2nd-order equational matching and unificationequational matching and unificationstring-rewriting systemsterm-rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Some independence results for equational unification
• Some results on equational unification
• Single versus simultaneous equational unification and equational unification for variable-permuting theories
• scientific article; zbMATH DE number 1189058

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• A unification algorithm for second-order monadic terms
• Decidable sentences of Church-Rosser congruences
• scientific article; zbMATH DE number 4155899 (Why is no real title available?)
• scientific article; zbMATH DE number 592370 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• Linear unification
• Makanin's algorithm for word equations-two improvements and a generalization
• Matching - a special case of unification?
• On two problems related to cancellativity
• Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
• Some independence results for equational unification
• Some results on equational unification
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• The undecidability of the second-order unification problem
• The word matching problem is undecidable for finite special string-rewriting systems that are confluent
• Two-Processor Scheduling with Start-Times and Deadlines
• Unification in the union of disjoint equational theories: Combining decision procedures

Cited in

(6)

• scientific article; zbMATH DE number 1189058 (Why is no real title available?)
• Some independence results for equational unification
• Second-order unification in the presence of linear shallow algebraic equations
• Some results on equational unification
• Equational theorem proving for clauses over strings
• One is all you need: associative second-order unification without first-order variables

This page was built for publication: Equational unification, word unification, and 2nd-order equational unification

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