A class of confluent term rewriting systems and unification
type: Item
instance of: scholarly article
title: A class of confluent term rewriting systems and unification
zbMATH Open document ID: 0642.68032
DOI: 10.1007/BF00248250
author: Jia-Huai You
author: P. A. Subrahmanyam
published in: Journal of Automated Reasoning
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 4047061
zbMATH Keywords: E-unification
zbMATH Keywords: narrowing
zbMATH Keywords: term rewriting systems
zbMATH Keywords: equational theories
describes a project that uses: NARROWER
MaRDI profile type: Publication
cites work: Equality, types, modules, and (why not?) generics for logic programming
cites work: Programming with Equations
cites work: Q3883561
cites work: Q3703312
cites work: Q5581665
cites work: Q3664457
cites work: Complete Sets of Reductions for Some Equational Theories
cites work: Q5678447
cites work: Q3696486
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Q3338215
full work available at URL: https://doi.org/10.1007/bf00248250
OpenAlex ID: W2092386169
Recommended article: Term Rewriting and Applications
Recommended article: Q3730013
Recommended article: Q2778882
Recommended article: The unification problem for confluent right-ground term rewriting systems.
Recommended article: Simplifying conditional term rewriting systems: Unification, termination and confluence
Recommended article: Some results on the confluence property of combined term rewriting systems
Recommended article: Confluence of curried term-rewriting systems
Recommended article: Q2778888
Recommended article: Confluence of nearly orthogonal infinitary term rewriting systems
Recommended article: Confluence of algebraic rewriting systems
description: scientific article; zbMATH DE number 4047061