Stuckey, Peter J. ; Sudarshan, S. (2005) Well-founded Ordered Search (extended abstract) In: Foundations of Software Technology and Theoretical Computer Science.
Full text not available from this repository.
Official URL: http://doi.org/10.1007/3-540-57529-4_51
Related URL: http://dx.doi.org/10.1007/3-540-57529-4_51
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: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Springer Nature Switzerland AG |
| Keywords: | Logic Program;Negative Cycle;Dependency Information;Negative Literal;DATALOG Program |
| ID Code: | 128549 |
| Deposited On: | 27 Oct 2022 06:21 |
| Last Modified: | 15 Nov 2022 11:04 |
Repository Staff Only: item control page
