Please use this identifier to cite or link to this item:
Title: Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models
Authors: STUCKEY, PJ
Keywords: Semantics
Issue Date: 1997
Citation: JOURNAL OF LOGIC PROGRAMMING, 32(3), 171-205
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. (C) Elsevier Science Inc., 1997.
ISSN: 0743-1066
Appears in Collections:Article

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.