论文信息 - A New Definition of SNDNF-Resolution

A New Definition of SNDNF-Resolution

Abstract We propose a new, “top-down” definition of SLDNF-resolution that 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 [7].

KRZYSZTOF R. APT | KEES DOETS

[1] David Chan,et al. Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.

[2] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.

[3] Keith L. Clark. Predicate logic as a computational formalism , 1979 .

[4] Dino Pedreschi,et al. Proving Termination of General Prolog Programs , 1991, TACS.

[5] Kenneth Kunen,et al. Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[6] John C. Shepherdson,et al. A Sound and Complete Semantics for a Version of Negation as Failure , 1989, Theor. Comput. Sci..

[7] Maurizio Martelli,et al. A New SLDNF-Tree , 1992, Inf. Process. Lett..

[8] John C. Shepherdson,et al. Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..