A New Definition of SLDNF-Resolution

@article{citeulike:1761592, abstract = {We propose a new, \"top-down\" definition of SLDNF-resolution which retains the spirit of the original definition but avoids the difficulties noted in the literature. We compare it with the \"bottom-up\" definition of Kunen [Kun89]. 1 The problem The notion of SLD-resolution of Kowalski [Kow74] allows us to resolve only positive literals. As a result it is not adequate to compute with general programs. Clark [Cla79] proposed to incorporate the negation as finite failure rule. This leads to an...}, author = {Apt, K. R. and Doets, K. }, citeulike-article-id = {1761592}, journal = {The Journal of Logic Programming}, keywords = {logic-programming, resolution, top-down}, month = {February}, number = {2}, pages = {177--190}, posted-at = {2007-10-12 20:27:34}, priority = {0}, title = {A New Definition of SLDNF-Resolution}, url = {http://citeseer.ist.psu.edu/apt92new.html}, volume = {18}, year = {1994} }

TY - JOUR ID - citeulike:1761592 L3 - citeulike-article-id:1761592 TI - A New Definition of SLDNF-Resolution JF - The Journal of Logic Programming VL - 18 IS - 2 SP - 177 EP - 190 N2 - We propose a new, "top-down" definition of SLDNF-resolution which retains the spirit of the original definition but avoids the difficulties noted in the literature. We compare it with the "bottom-up" definition of Kunen [Kun89]. 1 The problem The notion of SLD-resolution of Kowalski [Kow74] allows us to resolve only positive literals. As a result it is not adequate to compute with general programs. Clark [Cla79] proposed to incorporate the negation as finite failure rule. This leads to an... KW - logic-programming KW - resolution KW - top-down AU - Apt, KR AU - Doets, K PY - 1994/February// UR - http://citeseer.ist.psu.edu/apt92new.html ER -