Completion for unification

DOI10.1016/0304-3975(91)90182-2zbMath0735.68078OpenAlexW2092801425MaRDI QIDQ1178701

Claude Kirchner, Narjes Doggaz

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90182-2

zbMATH Keywords

unificationmutationmergingsyntactic theory

Mathematics Subject Classification ID

Artificial intelligence (68T99) Logic programming (68N17)

Related Items

Abstract canonical presentations

Cites Work

• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Varieties of ”If-Then-Else“
• A Unification Algorithm for Associative-Commutative Functions
• An Efficient Unification Algorithm
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completion for unification