A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We consider the problem of propagating selections into logic programs (i.e., recursive Horn clause programs). In particular, we study the class of chain programs and formalize selection propagation on such a logic program as: the task of finding an equivalent program containing only monadic derived predicates. Selection propagation is always possible for database programs (i.e., tirst-order formula programs) and is often a desirable optimization. We show that the situation is qualitativelydoi:10.1016/0022-0000(90)90035-j fatcat:5mkro4bjhncxleun6zk5vtmrrm