Semi-unification

DOI10.1016/0304-3975(91)90189-9MaRDI QIDQ808713zbMATH OpenOpenAlexFDO

Authors Deepak Kapur, Paliath Narendran, Jonathan Stillman, David R. Musser

Publication date 1991

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

Full work available at URL https://doi.org/10.1016/0304-3975(91)90189-9

zbMATH Keywords

rewrite ruleterm-rewriting systemnon-termination

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 4092757
• Fast algorithms for uniform semi-unification
• scientific article; zbMATH DE number 88941
• scientific article; zbMATH DE number 176162
• Upper bounds on height of terms in a solution of a semiunification problem

Cites work

• scientific article; zbMATH DE number 3829296 (Why is no real title available?)
• scientific article; zbMATH DE number 4035120 (Why is no real title available?)
• scientific article; zbMATH DE number 4047064 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• About the Paterson-Wegman linear unification algorithm
• Linear unification
• Orderings for term-rewriting systems
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

Cited in

(24)

• The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
• On subsumption and semiunification in feature algebras
• scientific article; zbMATH DE number 176162 (Why is no real title available?)
• scientific article; zbMATH DE number 88941 (Why is no real title available?)
• scientific article; zbMATH DE number 440473 (Why is no real title available?)
• Semi-unification of two terms in Abelian groups
• Relaxed unification -- proposal
• scientific article; zbMATH DE number 176152 (Why is no real title available?)
• Unification modulo nonnested recursion schemes via anchored semi-unification
• Loop detection in term rewriting using the eliminating unfoldings
• A \(\lambda\)-unifiability test for set theory
• Source-tracking unification
• Fast algorithms for uniform semi-unification
• scientific article; zbMATH DE number 2079021 (Why is no real title available?)
• scientific article; zbMATH DE number 4092757 (Why is no real title available?)
• The undecidability of the semi-unification problem
• Upper bounds on height of terms in a solution of a semiunification problem
• Une charpente de semi-unification
• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
• Constructive many-one reduction from the halting problem to semi-unification
• Semi-revision
• Termination of rule-based calculi for uniform semi-unification
• scientific article; zbMATH DE number 4180772 (Why is no real title available?)
• scientific article; zbMATH DE number 10159 (Why is no real title available?)

Describes a project that uses

Uses Software

• RRL

This page was built for publication: Semi-unification

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