Y. Moscowitz and E. Shapiro. Lexical Logic Programs. In K. Furukawa, editor, Proc. of the 6th Int.l Conference on Logic Programming, pages 2349-363. The MIT Press, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the clauses in D be loaded before evaluating G and then unloaded after G succeeds or fails. Implication goals as structuring tools were then used by a number of other authors in the attempt to capture more powerful scoping and modular constructs than those introduced by Miller (see for instance [27] and [15] Although different in their motivations, the two approaches are actually strictly related. In fact, the composition mechanisms are conceptually the same; the difference is that they act as meta linguistic operators in the former and a linguistic operators on the latter (see [9] for a ....

Y. Moscowitz and E. Shapiro. Lexical Logic Programs. In K. Furukawa, editor, Proc. of the 6th Int.l Conference on Logic Programming, pages 2349-363. The MIT Press, 1991.

....goal is solved is to load the antecedent D subprogram into the currently running program, and then attempt to solve the consequent in the usual fashion. The usage of this method depends largely on the nature of the quantification. In this respect there are several variants including [50, 56, 49] [54, 55], 52, 53] and [6] To start with let us suppose we have universal quantification of all predicates in the antecedent and existential quantification of all variables local to the antecedent (that is, those not in the consequent; if all variables were existentially quantified there would be no ....

Yael Moscowitz and Ehud Shapiro. Lexical logic programs. In Furukawa [18], pages 349--363.

....messages were proposed [62, 13, 19] as a way to achieve a logical reinterpretation for some of the distinguishing features of the Object Oriented programming paradigm. Later extensions to the framework of [71] led Miller and his colleagues [70, 85] and, independently, Shapiro and Moscowitz [82], to study other (higher order) logical frameworks where different notions of scope over clauses and program constants could be modeled. Outline. In this paper we survey the existing literature on this area. Both the aforesaid lines of research will be taken into account. One of the points of the ....

....The associated proof relation will be presented in terms of a corresponding inference system in the sequent calculus. It could be argued that a more direct presentation of the operational semantics could be given relying on a transformational approach as it has been done, for instance, in [79] and [82]. The semantics of the extended language could be defined in terms of a mapping from programs in the extended language to corresponding Horn clause programs. We could then appeal to the theory of SLD resolution to specify (and logically justify) the computational behaviour of the extended ....

[Article contains additional citation context not shown here]

Y. Moscowitz and E. Shapiro. Lexical logic programs. In K. Furukawa, editor, Proc. 8th Int. Conference on Logic Programming, pages 349--363. The MIT Press, 1991.

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