A completion procedure for conditional equations
type: Item
instance of: scholarly article
title: A completion procedure for conditional equations
zbMATH Open document ID: 0724.68053
DOI: 10.1016/S0747-7171(08)80132-0
author: Harald Ganzinger
published in: Journal of Symbolic Computation
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 03C05
zbMATH DE Number: 4195189
zbMATH Keywords: completion
zbMATH Keywords: conditional equations
zbMATH Keywords: conditional rewriting
MaRDI profile type: Publication
cites work: Solvable cases of the decision problem
cites work: Proof normalization for resolution and paramodulation
cites work: Completion of first-order clauses with equality by strict superposition
cites work: Conditional rewrite rules: Confluence and termination
cites work: Termination of rewriting
cites work: Proving termination with multiset orderings
cites work: Q3753472
cites work: Q3809250
cites work: Q3028369
cites work: A complete proof of correctness of the Knuth-Bendix completion algorithm
cites work: Q3703312
cites work: Conditional rewrite rules
cites work: Q3709891
cites work: Q3028335
cites work: Q3798649
cites work: Q3702510
cites work: Q3993260
cites work: Clausal rewriting
cites work: Q3745825
cites work: Q3696496
cites work: On restrictions of ordered paramodulation with simplification
description: scientific article; zbMATH DE number 4195189