Program completion in predicate logic
Christopher John Hogger · 1990
Abstract The construction of the completion Comp(P) when P is a predicate-logic program is slightly more complicated than in the propositional case. Consider first the simplest example in which P comprises just a single ground assertion The completion must express that ‘q’ holds for ‘a’ and for that term only-that is, (VX)(q(X) iff X=a). The ‘if’ component of the latter sentence is obtained by generalizing the given clause for ‘q’, so that in place of q(a) we write