The sequent calculus provides a generic foundation for proof search in
logical systems, but it is too non-deterministic as a foundation for
logic programming. In this lecture we present uniform
derivations as a further restriction on sequent derivations which
makes the resulting logic suitable as the basis for a logic programming
language, where computation is proof search. Uniform derivations are
not complete for full first-order logic, which suggests the fragment
consisting of positive formulas only as the basis for logic programming.