M. Maher and R. Ramakrishnan, "D'ej`a Vu in Fixpoints of Logic Programs," Proc. North American Conference on Logic Programming, Cleveland, OH, 1989, pp. 963--980.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to apply the techniques described in this subsection. If not, we can only infer that literal s 2 would be invoked twice, and since for each input to s 2 only one output is generated, W would get two bindings, instead of just one. A sufficient condition for duplicate free predicates is given in [26]. Finally, it may sometimes be necessary to explicitly account for implicit failures. The problem is illustrated by the following program to check membership in a list: member(X, X ] member(X, L] member(X, L) A straightforward analysis would infer the equation Sol member (n) ....

M. Maher and R. Ramakrishnan, "D'ej`a Vu in Fixpoints of Logic Programs," Proc. North American Conference on Logic Programming, Cleveland, OH, 1989, pp. 963--980.

....al. 13] Alternatively, we can consider the following variation on this example: the operator Omega is defined as before, but ] is modified so that it yields only irredundant sets of elements, where an element of a set S is redundant if and only if it is subsumed by some other element of S [22]. In other words, S ] is the set of maximal elements of S, where the partial order is the usual more general than ordering on terms (modulo variable renaming) In this case, the computation involves subsumption checking each time the rules are applied. The following properties of b Phi ....

M. Maher and R. Ramakrishnan, "D'ej`a Vu in Fixpoints of Logic Programs", Proc. NACLP-89, Cleveland, OH, Oct. 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