| Kolaitis, P.G. The expressive power of stratified programs Manuscript (1987). |
....of a stratified program may not be stratified, and several authors have considered the problem of extending magic sets to stratified programs. The approach of [2, 3] involves relabeling some predicates, while [4, 9, 10] sequence the execution of rules in the bottom up computation. Kolaitis [11] showed that there are several interesting logic programs that are not stratifiable but for which a natural semantics exists. This points out the need to efficiently compute the natural models of non stratifiable programs. Recently, Ross [15] proposed a bottom up evaluation method for computing ....
Kolaitis, P.G. The expressive power of stratified programs Manuscript (1987).
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