Synthesis of a unification algorithm in a logic programming calculus

DOI10.1016/0743-1066(84)90020-7MaRDI QIDQ3691055zbMATH OpenOpenAlexFDO

Authors Lars-Henrik Eriksson

Publication date 1984

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(84)90020-7

zbMATH Keywords

formal specificationcorrectnessHorn clausesprogram synthesislogic language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Formal synthesis of a unification algorithm by the deductive-tableau method
• scientific article; zbMATH DE number 4047179
• Unifying theories for logic programming
• scientific article; zbMATH DE number 36613
• The Qu-Prolog unification algorithm: formalisation and correctness

Cited in

(6)

• Selective Unification in (Constraint) Logic Programming*
• Formal synthesis of a unification algorithm by the deductive-tableau method
• The Qu-Prolog unification algorithm: formalisation and correctness
• Extended unification algorithms for the integration of functional programming into logic programming
• scientific article; zbMATH DE number 6820296 (Why is no real title available?)
• scientific article; zbMATH DE number 3921947 (Why is no real title available?)

This page was built for publication: Synthesis of a unification algorithm in a logic programming calculus

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