The second transformation is of independent interest, since it answers
two open problems of Sebelik and Stepanek [1980]. A third example gives the
correctness of a transformation system similar to—but weaker than—the trans-
formation system of Tamaki and Sato [1986].
Semantics
Of
Logic
Programs
A language consists of three disjoint sets: the variables V, the function sym-
bols X, and the predicate symbols Π. We take the approach that a language is
fixed and that programs and queries can use only the variables of V, function
symbols of X, and predicate symbols Π. We assume that the languag ...
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.