On completeness of narrowing strategies
type: Item
instance of: scholarly article
title: On completeness of narrowing strategies
zbMATH Open document ID: 0698.68027
DOI: 10.1016/0304-3975(90)90032-D
author: Rachid Echahed
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
review text: See the review in Zbl 0645.68044.
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 08C05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 4145314
zbMATH Keywords: algebraic specifications
zbMATH Keywords: completeness of narrowing strategies
zbMATH Keywords: reduction
zbMATH Keywords: E-unifiers
MaRDI profile type: Publication
cites work: Contributions to the Theory of Logic Programming
cites work: The relation between logic and functional languages: a survey
cites work: Q3713559
cites work: Q3771660
cites work: Q3742703
cites work: Equality, types, modules, and (why not?) generics for logic programming
cites work: Q3703312
cites work: Q3883561
cites work: Conditional rewrite rules
cites work: Q3687683
cites work: Q3856120
cites work: Basic narrowing revisited
cites work: Q3774997
cites work: Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Recommended article: Q3789062
Recommended article: On proving properties of completion strategies
Recommended article: Completeness results for basic narrowing
Recommended article: Q4941932
Recommended article: Strategy subsets closed under rational behavior
Recommended article: Q3755265
Recommended article: Strategy-proofness on restricted separable domains
Recommended article: A decomposition of strategy-proofness
Recommended article: Q2980973
description: scientific article; zbMATH DE number 4145314