A Unification Free Introduction to Logic Programming

In this paper, we give a new presentation of the fundamental results of the theory of Logic Programming, which differs from classical introductions in at least two ways: the use of predicate algebras to deal with model theoretical aspects and the parameterization of the resolution algorithm with respect to the specific unification algorithm implemented