Stuckey, Peter J. ; Sudarshan, S. (1997) Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models The Journal of Logic Programming, 32 (3). pp. 171-205. ISSN 07431066
![]() |
PDF
2MB |
Official URL: http://doi.org/10.1016/S0743-1066(96)00110-0
Related URL: http://dx.doi.org/10.1016/S0743-1066(96)00110-0
Abstract
There have been several evaluation mechanisms proposed for computing query answers based on the well-founded semantics, for programs with negation. However, these techniques are costly; in particular, for the special case of modularly stratified programs, Ordered Search is more efficient than the general-purpose techniques. However, Ordered Search is applicable only to modularly stratified programs. In this paper, we extend Ordered Search to compute the well-founded semantics for all (non-floundering) programs with negation. Our extension behaves exactly like Ordered Search on programs that are modularly stratified, and hence pays no extra cost for such programs.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Elsevier B.V |
ID Code: | 128530 |
Deposited On: | 27 Oct 2022 04:22 |
Last Modified: | 27 Oct 2022 04:22 |
Repository Staff Only: item control page