scientific article

zbMath0578.68029MaRDI QIDQ3700828

Hassan Aït-Kaci

Publication date: 1985

Full work available at URL: https://eudml.org/doc/92240

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

function symbolsProlog programautomatic inference methodcomplete automation of the Knuth- Bendix methodminimal partial orderingterm-rewriting rulestermination-proving program

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items

Termination of rewriting, Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach

Uses Software

• REVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Computing in systems described by equations
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• On multiset orderings
• Computing with rewrite systems
• Proving termination with multiset orderings
• Complete Sets of Reductions for Some Equational Theories
• Programming with Equations
• Tree-Manipulating Systems and Church-Rosser Theorems