Basic narrowing revisited
type: Item
instance of: scholarly article
title: Basic narrowing revisited
zbMATH Open document ID: 0682.68094
DOI: 10.1016/S0747-7171(89)80014-8
author: Werner Nutt
author: Pierre Réty
author: Gert Smolka
published in: Journal of Symbolic Computation
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 03D03
zbMATH DE Number: 4117896
zbMATH Keywords: narrowing
zbMATH Keywords: initial algebra
zbMATH Keywords: rewriting system
zbMATH Keywords: equation solving
zbMATH Keywords: Resolution rules
zbMATH Keywords: Failure rules
zbMATH Keywords: Simplification rules
zbMATH Keywords: rewriting rule
zbMATH Keywords: safe blocking rule
zbMATH Keywords: unfolding rule
MaRDI profile type: Publication
cites work: Q3771660
cites work: Q3782762
cites work: Equality, types, modules, and (why not?) generics for logic programming
cites work: Q3765265
cites work: Q3783622
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Q3883561
cites work: Q3703312
cites work: Q3709891
cites work: Q3339245
cites work: Q3696486
cites work: Q3779784
cites work: Q5624683
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
cites work: A class of confluent term rewriting systems and unification
description: scientific article; zbMATH DE number 4117896