Modularity in Logic Programming

The research on modular logic programming has evolved along two diKerent directions during the past decade. Various papers have focused primarily on the problems of programming-in-the-large. They have proposed mod- ule systems equipped with compositional operators for building programs as combinations of separate and independent components. Other propos- als have instead concentrated on the problem of programming-in-the-small in an attempt to enrich logic programming with abstraction and scoping mechanisms available in other programming paradigms.

The issues that arisein the two approaches are substantially different. The compositional operators of the former allow one to structure programs without any need to extend the theory of Horn clauses. The scoping and abstraction mechanisms of the latter are modeled in terms of the logical connectives of extended logic languages.

ln this paper we provide a uniform reconstruction of the above approaches and we show, wherever this is possible, how the object-level logical connec- tives of the latter can be mapped onto the compositional operators of the former.