Oriented equational logic programming is complete

DOI10.1006/JSCO.1996.0075MaRDI QIDQ1355756zbMATH OpenOpenAlexFDO

Authors O. Diekmann, Christopher Lynch

Publication date 28 May 1997

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/2df6f2ff5ef838c59c0a6240129a96c879ae6d17

zbMATH Keywords

basic conditional narrowingSLD-resolution

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Extending SLD resolution to equational horn clauses using E-unification
• On the completeness of SLDENF-resolution
• Foundations of equational logic programming
• Horn equational theories and paramodulation
• Combining Logic Programming and Equation Solving

Cited in

(3)

• Stratified resolution
• Oriented equational clauses as a programming language
• Automatic verification of security protocols in the symbolic model: the verifier ProVerif

This page was built for publication: Oriented equational logic programming is complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355756)