Abstract
There have been several evaluation mechanisms proposed for computing query answers based on the well-founded semantics, for progrants with negation. However, these techniques are costly; in particular, for the special case of modularly stratified programs Ordered Search is more efficient titan 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.
Cite
CITATION STYLE
Stuckey, P. J., & Sudarshan, S. (1993). Well-founded ordered search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 761 LNCS, pp. 161–171). Springer Verlag. https://doi.org/10.1007/3-540-57529-4_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
