S. K. Debray. Flow analysis of dymanic logic programs. Journal of Logic Programming, 7:149--176, 1989.  Home/Search   Document Not in Database   Summary   Related Articles

....predicate symbol become closed or partially instantiated or remain variable when a literal in which this n ary predicate symbol occurred has to be selected in a goal. This definition of the mode of an n ary predicate symbol is more general than the prescriptive, that is declarative, one given in [4, 6], which states that the mode of an n ary predicate symbol in a logic program indicates how its arguments have to be instantiated when that n ary predicate symbol appears in a goal; it is a functional definition of a mode of an n ary predicate symbol. Prescriptive mode or well known as syntactic ....

....Our method can also be used to verify the consistency of user supplied mode declarations. Such a consistency verification for user supplied mode declarations is necessary because of errors which may be made by the user. One can use this mode inference to improve the efficiency of logic programs [2, 3, 4, 6, 9, 11, 12, 13, 16, 22] or to control the evaluation of logic programs [14] or to prove the completeness of SLDNF resolution for a large class of programs [20, 21] 3 Preliminaries and motivating examples Let V be a countably infinite set of variables, for each n 0 a countably infinite set F of function symbols be ....

[Article contains additional citation context not shown here]

S. K. Debray. Flow analysis of dymanic logic programs. Journal of Logic Programming, 7:149--176, 1989.

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