Record Details

Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Well-founded ordered search: Goal-directed bottom-up evaluation of well-founded models
 
Creator STUCKEY, PJ
SUDARSHAN, S
 
Subject semantics
 
Description 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.
 
Publisher ELSEVIER SCIENCE INC
 
Date 2011-07-27T13:45:03Z
2011-12-26T12:57:17Z
2011-12-27T05:47:19Z
2011-07-27T13:45:03Z
2011-12-26T12:57:17Z
2011-12-27T05:47:19Z
1997
 
Type Article
 
Identifier JOURNAL OF LOGIC PROGRAMMING, 32(3), 171-205
0743-1066
http://dx.doi.org/10.1016/S0743-1066(96)00110-0
http://dspace.library.iitb.ac.in/xmlui/handle/10054/7239
http://hdl.handle.net/10054/7239
 
Language en