| M. Dincbas and J-P. Lepape. Metacontrol of Logic Programs in METALOG. In Proc. International Conference on Fifth Generation Computer Systems (FGCS'84), pages 361-370, Tokyo, Japan, November 1984. ICOT. |
....the call is matched with the head of the rst delay clause. This matching is not the usual Prolog uni cation but only a unidirectional pattern matching the variables in the call cannot be bound by it. This is necessary in order not to mix the metalevel control with the object level, similar to [8]. If the matching succeeds, the body of the delay clause is executed. If all the body subgoals succeed, the call is suspended. Otherwise, or if the head matching fails, the next delay clause is tried and if there is none, the call continues normally without suspending. The goals in the body of ....
Mehmet Dincbas and Jean-Pierre Le Pape. Metacontrol of logic programs in metalog. In Proceedings of the International Conference on Fifth Generation Computer Systems 1984, pages 361-370, 1984.
....of this paper we have discussed a variety of related papers; those citations shall not be repeated here. We mention here only the most closely related publications from the large body of literature on meta level systems and control. Some of the earliest work on meta control includes [Dav80, DFN86, DL84] Meta language constructs whose semantics are similar to the constructs in our system were suggested by Gallaire and Lasserre [GL82, GL79] however, their specification of the semantics was vague. Declaration of relevancy has a similar e#ect as Gallaire and Lasserre s finish predicate. The idea ....
M. Dincbas and J. P. Le Pape. Metacontrol of logic programs in METALOG. In International Conference on Fifth Generation Computing Systems, pages 361--370, 1984.
....respect to the axioms of a context and proofs are recorded. In the OMEGA system [3] a metalanguage defines the syntax of expressions and statements, viewpoints describe sets of assumptions, and the consequence concept formalizes derivability relationship between statements and viewpoints. METALOG [17], an extension of Prolog, explicitly asserts control knowledge separate from regular clauses in the system, and uses this control knowledge when it chooses a literal from a goal list and a clause from the clause database. Russell s MRS system [34] and the system developed by Gallaire and Lasserre ....
Dincbas, M., and Le Pape, J., Metacontrol of Logic Programs in METALOG, in: Proc. of Int. Conf. on Fifth Generation Computer Systems, Tokyo, 1984.
....Ideas for the semantics of need, needby, and ready which are vaguely given by Gallaire and Lasserre provided some inspiration for the exact specification of the predicates before 2, not ready 1 and hot 1 in this paper. Gallaire and Lasserre s work influenced other publications among which are [DLP84, DFN86, Esh86]. Other examples of Prolog like systems that offer additional control features are listed by Naish [Nai85] Mu Prolog and its successor Nu Prolog [Nai85] provide the means of wait declarations in order to express the allowed directions for the use of predicates. 18 Risc offers two ways of ....
Dincbas, M.; Le Pape, J. P.: Metacontrol of logic programs in METALOG. In: Proceedings of the International Conference on Fifth Generation Computing Systems, pages 361--370, 1984.
....Ideas for the semantics of need, needby, and ready which are vaguely given by Gallaire and Lasserre provided some inspiration for the exact specification of the predicates before 2, notready 1 and hot 1 in this paper. Gallaire and Lasserre s work influenced other publications among which are [DLP84, DFN86, Esh86]. Other examples of Prolog like systems that offer additional control features are listed by Naish [Nai85] Mu Prolog and its successor Nu Prolog [Nai85] provide the means of wait declarations in order to express the allowed directions for the use of predicates. 22 Risc offers two 21 Meta ....
Dincbas, M.; Le Pape, J. P.: Metacontrol of logic programs in METALOG. In: Proceedings of the International Conference on Fifth Generation Computing Systems, pages 361--370, 1984.
....i.e. C j= 8) c) Constraint entailment was introduced in the context of concurrent logic programming (e.g. 56] by Maher [43] to endow these languages with a logical semantics. It can be viewed as well as a generalization of languages allowing coroutining and delay mechanisms (e.g. [10, 9, 16, 28, 47]) and is one of the cornerstones of the cc framework, where it is used to synchronize concurrently executing agents. It was also used in CHIP (see [21, 31] inside the if then else construct and was instrumental in simulating hybrid circuits. Its interest for CLP languages lies in the opportunity ....
M. Dincbas and J-P. Lepape. Metacontrol of Logic Programs in METALOG. In Proc. International Conference on Fifth Generation Computer Systems (FGCS'84), pages 361-370, Tokyo, Japan, November 1984. ICOT.
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