L. Giordano, A. Martelli, and G.F. Rossi. Local definitions with static scope rules in logic programming. In Proc. of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the family of Actor languages (see for instance [1] as we have shown in [5] One of the main aims of LO is that of providing a more structured notion of goal formula, suitable to represent structured objects with changeable state. In this sense, our effort is complementary with efforts such as [14, 24, 23, 26], which introduce a more structured notion of logic program, suitable for modular logic programming. Recent developments in this direction [18] also make use of Linear Logic operators to implement more refined notions of control. Acknowledgement We are indebted to Francois Bry, Gerard Comyn, ....

L. Giordano, A. Martelli, and G.F. Rossi. Local definitions with static scope rules in logic programming. In Proc. of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, 1988.

....but rather one has to address objects using explicit object identifiers. One of the main aims of LO is that of providing a more structured notion of goal formula, suitable to represent structured objects with changeable state. In this sense, our effort is complementary with efforts such as [9, 18, 17, 20], which introduce a more structured notion of logic program, suitable for modular logic programming. It would be particularly interesting to compare our approach with recent developments of this line of research towards objectoriented programming [13] Finally, we would like to compare it in ....

L. Giordano, A. Martelli, and G.F. Rossi. Local definitions with static scope rules in logic programming. In Proc. of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, 1988.

....may depend on the context in which they are used. Similarly, the mechanism for supplying security in abstract datatypes is described as a runtime check ; it cannot, in general, be done at compile time. For proposals of more static notions of modules and abstract datatypes for logic programs, see [4, 15, 20, 21]. 2. The logic programming language L Consider a logic that contains constants and variables for individuals, functions, and predicates. Let A; D;G be syntactic variables that range over the following classes of formulas. A : atomic formula 2. The logic programming language L 14 May 1997 D : ....

L. Giordano, A. Martelli, and G. Rossi, Local Definitions with Static Scope Rules in Logic Programming, Proceedings of the FGCS International Conference, Tokyo, 1988, pp. 389-396.

....L 1 ; Ln of i literals. Goals denote existentially closed formulas. For sample programs see figure 1. Note, that only programs, i.e. sets of universally closed formulas, are allowed in the premise of i literals. This is a major difference from the languages proposed e.g. in [18] [11], 9] Neither in clauses nor in goals multiple consequences or nested implications are allowed. However, such programs and goals can easily be transformed into the basic syntax. In this paper program names are considered part of the basic syntax, and mutual program reference is allowed 2 . We ....

.... Delta Delta) Delta Delta Delta) a minimal fixpoint MW of TW is computed. Proof. We skip over the rather technical details and refer the reader to [7] We generalize the notion of the perfect model [21] and can prove, that MW is the perfect generalized Herbrand model of W [7] The approach of [11] is very close to ours, but our semantics allows for passing predicate definitions from a program to an external reference. Negation as failure is problematic even in ordinary logic programs due to its intrinsic nonmonotonic behaviour. The situation grows more difficult when sets of programs are ....

Giordano L., Martelli A., Rossi G.: Local Definitions with Static Scope Rules in Logic Programming. Proc. Intl. Conf. on 5th Gen. Comp. Syst., 1988, p. 389-396

....in Section 5 illustrate why this more dynamic notion of scoping may be needed. In particular, abstract object classes refer to predicates that are defined only later when members of concrete object classes are created. This style of programming would not be possible using the proposal presented in [10,18]. We hope in the future to extend the analysis of this programming style in several directions. The question of how a class definition might redefine an inherited method will be investigated, as will changes to the current syntax to make continuation passing implicit. It is expected that this may ....

L. Giordano, A. Martelli, and G. Rossi. Local definitions with static scope rules in logic programming. In Proceedings of the FGCS International Conference, pages 389--396, 1988.

....to ordinary deductive database programs. In a subsequent bottom up query evaluation phase the proper set of answer tuples is computed in a set at a time fashion. Our query evaluation scheme thus generalizes the evaluation scheme of most deductive database systems (see e.g. 7] The approach of [10] is very close to ours, but our semantics differs in the treatment of program references. In [10] an embedded implication defines an entirely new context, whereas our semantics allows for parameterization of the referenced module by predicates of the calling module. Referencing external modules ....

....proper set of answer tuples is computed in a set at a time fashion. Our query evaluation scheme thus generalizes the evaluation scheme of most deductive database systems (see e.g. 7] The approach of [10] is very close to ours, but our semantics differs in the treatment of program references. In [10] an embedded implication defines an entirely new context, whereas our semantics allows for parameterization of the referenced module by predicates of the calling module. Referencing external modules from within a program, as in our language, has the advantage, that a call to a previously tested ....

[Article contains additional citation context not shown here]

Giordano L., Martelli A., Rossi G.: Local Definitions with Static Scope Rules in Logic Programming, in: Proc. of the International Conference on Fifth Generation Computer Systems, 1988

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