Orienting rewrite rules with the Knuth-Bendix order.
type: Item
instance of: scholarly article
title: Orienting rewrite rules with the Knuth-Bendix order.
zbMATH Open document ID: 1054.68079
DOI: 10.1016/S0890-5401(03)00021-X
author: Konstantin Korovin
author: Andrei Voronkov
published in: Information and Computation
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1967124
zbMATH Keywords: Term rewriting
zbMATH Keywords: Orientability
zbMATH Keywords: Termination
zbMATH Keywords: Knuth-Bendix orders
zbMATH Keywords: Ordering constraints
MaRDI profile type: Publication
cites work: SOLVING SYMBOLIC ORDERING CONSTRAINTS
cites work: Q4954438
cites work: Handbook of automated reasoning. In 2 vols
cites work: Q3696498
cites work: Automating the Knuth Bendix ordering
cites work: Q4036585
cites work: Q5581665
cites work: Q4535077
cites work: On recursive path ordering
cites work: Q3336738
cites work: Q3779786
cites work: Invariants, patterns and weights for ordering terms
cites work: Q4263810
cites work: Simple LPO constraint solving methods
cites work: Q4298260
cites work: Q4221106
description: scientific article; zbMATH DE number 1967124