Semi-unification

DOI10.1016/0304-3975(91)90189-9zbMATH Open0732.68063OpenAlexW2914435326MaRDI QIDQ808713FDOQ808713

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

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

zbMATH Keywords

rewrite ruleterm-rewriting systemnon-termination

Mathematics Subject Classification ID

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

Cites Work

• Orderings for term-rewriting systems
• Linear unification
• Title not available (Why is that?)
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Title not available (Why is that?)
• About the Paterson-Wegman linear unification algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

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

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)