Unification modulo an equality theory for equational logic programming

DOI10.1016/0022-0000(91)90039-8zbMath0718.68021OpenAlexW1985147107MaRDI QIDQ2639627

Jia-Huai You

Publication date: 1991

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(91)90039-8

zbMATH Keywords

equational theorynarrowingO'Donnell's equational logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Logic programming (68N17) Equational classes, universal algebra in model theory (03C05)

Related Items (1)

An optimal narrowing strategy for general canonical systems

Cites Work

• A class of confluent term rewriting systems and unification
• Computing in systems described by equations
• Automated deduction by theory resolution
• Computing with rewrite systems
• Extended unification algorithms for the integration of functional programming into logic programming
• Logic programming with equations
• An Efficient Unification Algorithm
• Equality, types, modules, and (why not?) generics for logic programming
• Unnamed Item
• Unnamed Item
• 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: Unification modulo an equality theory for equational logic programming