Proof lengths for equational completion

DOI10.1006/INCO.1996.0028zbMath0853.68153DBLPjournals/iandc/PlaistedS96OpenAlexW2088725049WikidataQ59444476 ScholiaQ59444476MaRDI QIDQ1917087

Andrea Sattler-Klein, David Alan Plaisted

Publication date: 12 December 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/31a4a961fc2d4f1139aee41eed130d548397219c

zbMATH Keywords

ground term-rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (8)

Intersection of finitely generated congruences over term algebra ⋮ Term rewriting restricted to ground terms. ⋮ On ground tree transformations and congruences induced by tree automata. ⋮ A rewriting approach to satisfiability procedures. ⋮ Canonical Ground Horn Theories ⋮ On the modelling of search in theorem proving -- towards a theory of strategy analysis ⋮ Congruential complements of ground term rewrite systems ⋮ Restricted ground tree transducers

This page was built for publication: Proof lengths for equational completion