scientific article
From MaRDI portal
Publication:3970984
zbMath0745.68115MaRDI QIDQ3970984
Nachum Dershowitz, Jean-Pierre Jouannaud
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grammars and rewriting systems (68Q42) Computing methodologies for text processing; mathematical typography (68U15)
Related Items (17)
Combinations of simplifying conditional term rewriting systems ⋮ A new approach to general E-unification based on conditional rewriting systems ⋮ Linear completion ⋮ A case study of completion modulo distributivity and Abelian groups ⋮ Improving transformation systems for general E-unification ⋮ Automatic termination proofs with transformation orderings ⋮ Towards an efficient construction of test sets for deciding ground reducibility ⋮ Fast algorithms for uniform semi-unification ⋮ E-Unification based on Generalized Embedding ⋮ Craig interpolation with clausal first-order tableaux ⋮ An improved general path order ⋮ What Is Essential Unification? ⋮ Towards a foundation of completion procedures as semidecision procedures ⋮ Deciding observational congruence of finite-state CCS expressions by rewriting ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ Learning from Łukasiewicz and Meredith: investigations into proof structures ⋮ Modular and incremental automated termination proofs
This page was built for publication:
