One of the most important relationships between programs (in any program-
ming language) is the equivalence of such programs. This relationship is at the
basis of most, if not all, programming methodologies. This paper provides a
systematic comparison of the relative strengths of various formulations of
equivalence for logic programs. It also introduces the notion of subsumption-
equivalence, which is used to give syntactic characterizations of the programs
Ρ for which the function T
p
satisfies some continuity properties.
Introduction ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.