Pascal Van Hentenryck Baudouin Le Charlier, Sabina Rossi. Sequence-based abstract interpretation of prolog. Theory and Practice of Logic Programming, 2(1):25{ 84, 2002.  Home/Search   Document Not in Database   Summary   Related Articles

.... 2 O(P; Q) if j i then Q j ;P 2 Q Modelling the operational behaviour of a logic program as a sequence of answers rather than as a set (as e.g. in [12, 5] explicitly takes the order in which solutions are found into account, and allows for multiple occurrences of the same answers (e.g. [3, 22, 11, 4]) Example 3. If P represents the program in Fig. 1 and Q the query path(a; X) then we have that O(P; Q) fX=bg; fX=cg; fX=bg) Note that O(P; Q) may be an in nite sequence, modelling the case where the Prolog evaluation mechanism constructs an in nite number of derivations and returns an ....

....semantics of Prolog that also models the depth rst search rule and the cut. The semantics consists of a sequence of pairs, of which one part denotes a computed answers while the other part the so called observability constraints give information about the cut executions. Also related is [4], in which the authors present a framework for the abstract interpretation of Prolog that handles the depth rst search rule and cut. It models program execution by sequences of substitutions that represent the sequences of computed answer substitutions returned by a query p(X) Contrary to our ....

Pascal Van Hentenryck Baudouin Le Charlier, Sabina Rossi. Sequence-based abstract interpretation of prolog. Theory and Practice of Logic Programming, 2(1):25{ 84, 2002.

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