Synthesis of a unification algorithm in a logic programming calculus
Copyright policy )Synthesis of a unification algorithm in a logic programming calculus
The author uses a formal specification to derive a unification program in a logic language (Horn clauses and negation). The unification that is derived is equal to the usual program that is used for unification as given by \textit{J. A. Robinson} [J. Assoc. Comput. Mach. 12, 23-41 (1965; Zbl 0139.123)]. The partial correctness follows from the specification. The total correctness is not shown, however, the way to prove is given.
- Uppsala University Sweden
formal specification, Specification and verification (program logics, model checking, etc.), logic language, correctness, Logic, Horn clauses, Formal languages and automata, program synthesis, Abstract data types; algebraic specification, Theorem proving (deduction, resolution, etc.)
formal specification, Specification and verification (program logics, model checking, etc.), logic language, correctness, Logic, Horn clauses, Formal languages and automata, program synthesis, Abstract data types; algebraic specification, Theorem proving (deduction, resolution, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).10 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!