9 citations found. Retrieving documents...
R. O'Keefe. Towards an algebra for constructing logic programs. In J. Cohen and J. Conery, editors, Proceedings of IEEE Symposium on Logic Programming, pages 152--160. IEEE Computer Society Press, 1985.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Generalized Quantifiers in Logic Programs - Eiter, Gottlob, Veith (1997)   (Correct)

....For both problems, so far mainly ad hoc solutions have been proposed. Modular logic programming has been approached from two main directions [10] The one direction is to build an algebra of programs, in which composition operators are available for combining two programs into a single one (cf. [19, 45]) The other direction resorts to using concepts of modal logic and embedded implications for defining the meaning of subgoals which access external functions (cf. 42] Both approaches, however, have problems in handling negation, and typically, negation is disregarded for combined programs. ....

R. O'Keefe. Towards an Algebra for Constructing Logic Programs. In Proceedings of the IEEE Symposium on Logic Programming, pages 152--160. IEEE CS Press, 1985.


Modular Logic Programming and Generalized Quantifiers - Eiter, Gottlob, Veith (1997)   (1 citation)  (Correct)

....ning subprograms must be supported, which may be referred to at di erent places in a program. This requires appropriate scoping and abstraction mechanisms for program modules. This need has initiated a large number of investigations, which evolved into the area of modular logic programming, e.g. [32, 35, 29, 17, 22, 5]; see [5] for a comprehensive survey. The research on logic programming with modules has followed two mainstreams [5] The one is programming in the large, where compositional operators are provided for combining separate and independent modules, e.g. 35, 29, 17] Here, the approach is to provide ....

....logic programming, e.g. 32, 35, 29, 17, 22, 5] see [5] for a comprehensive survey. The research on logic programming with modules has followed two mainstreams [5] The one is programming in the large, where compositional operators are provided for combining separate and independent modules, e.g. [35, 29, 17]. Here, the approach is to provide operators which allow to algebraically combine programs, which does not need for an extension of the theory of logic programs. The other direction is programmingin the small, which aims at enhancing logic programming with abstraction and scoping mechanism ....

[Article contains additional citation context not shown here]

R. O'Keefe. Towards an Algebra for Constructing Logic Programs. In Proceedings of the IEEE Symposium on Logic Programming, pages 152-160. IEEE CS Press, 1985.


Modular Logic Programming and Generalized Quantifiers - Eiter, Gottlob, Veith (1997)   (1 citation)  (Correct)

....stable models, expressive power 1 Introduction Structured Logic Programming requires the possibility to define subprograms along with scoping and abstraction mechanisms. This need has initiated a large number of investigations, which evolved into the area of modular logic programming, e.g. [26, 29, 23, 14, 17, 4]; see [4] for a comprehensive survey. The research on systems of logic program modules has followed two mainstreams [4] The one is programming in the large, where compositional operators are provided for combining separate and independent modules, e.g. 29, 23, 14] Extended Abstract, with ....

....programming, e.g. 26, 29, 23, 14, 17, 4] see [4] for a comprehensive survey. The research on systems of logic program modules has followed two mainstreams [4] The one is programming in the large, where compositional operators are provided for combining separate and independent modules, e.g. [29, 23, 14]. Extended Abstract, with most proofs omitted. An extended technical report including all proofs is available from the authors. Here, the approach is to provide operators which allow to algebraically combine programs, which does not need for an extension of the theory of logic programs. The ....

R. O'Keefe. Towards an Algebra for Constructing Logic Programs. In Proc. IEEE Symposium on Logic Programming, pp. 152--160. IEEE CS Press, 1985.


Transformation And Analysis Of (constraint) Logic Programs - Etalle (1995)   (10 citations)  (Correct)

....For these reasons, modular ity has been receiving received a considerable attention and, as the recent survey [24] shows, in the last few years several different proposals were introduced for integrating module constructs into logic languages. Here we adhere to the original approach of R. O Keefe [76], and we consider a constraint logic program to be a combination of several separate modules, where different modules are combined together by a simple composition operator 5. All the (unfold fold) transformation systems proposed so far for (constraint) logic programs, with the only exception ....

....computation. Finally, by naturally extending the usual notion used for pure logic programs, we say that a query c [ is a istacc of the query d [ D iff for any solution of c there exists a solution 5 of d such that 5. 6.3 Modular CLP Programs Following the original paper of R. O Keefe [76], the approach to modular programming we consider here is based on a mcta liguistic programs composition mechanism. This provides a formal background to the usual software engineering techniques for the incremental development of programs. Viewing modularity in terms of mcta liguistic operations ....

R. A. O'Keefe. Towards an Algebra for Constructing Logic Programs. In Proc. IEEE Syrup. o Logic Programmizg, pages 152 160, 1985.


On the Semantics of Logic Program Composition - Antonio Brogi Department   (Correct)

No context found.

R. O'Keefe. Towards an algebra for constructing logic programs. In J. Cohen and J. Conery, editors, Proceedings of IEEE Symposium on Logic Programming, pages 152--160. IEEE Computer Society Press, 1985.


A Compositional Semantics for - Conditional Term Rewriting   (Correct)

No context found.

R. A. O'Keefe. Towards an Algebra for Constructing Logic Programs. In Proc. IEEE Symp. on Logic Programming, pages 152--160. IEEE, 1985.


A New Module System for Prolog - Cabeza, Hermenegildo (2000)   (11 citations)  (Correct)

No context found.

R.A. O'Keefe. Towards an algebra for constructing logic programs. In IEEE Symposium on Logic Programming, pages 152-160, Boston, Massachusetts, July 1985. IEEE Computer Society.


A New Module System for Prolog - Daniel Cabeza And (1999)   (11 citations)  (Correct)

No context found.

R.A. O'Keefe. Towards an algebra for constructing logic programs. In IEEE Symposium on Logic Programming, pages 152-160, Boston, Massachusetts, July 1985. IEEE Computer Society. 15


A Modal Extension of Logic Programming: Modularity.. - Baldoni, Giordano.. (1998)   (4 citations)  (Correct)

No context found.

R. A. O'Keefe. Towards an Algebra for Constructing Logic Programs. In Proc. of the Symposium on Logic Programming, pages 152--160, Boston, 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC