A completeness theorem for SLDNF resolution
A COMPLETENESS THEOREM FOR SLDNF RESOLUTION Page 1 J. LOGIC
PROGRAMMING 1989:7:177-191 177 A COMPLETENESS THEOREM FOR SLDNF
RESOLUTION L. CAVEDON AND JW LLOYD D We. prove the completeness of SLDNF
resolution and negation as failure for stratified, normal programs and normal goals, under
the conditions of strictness and allowedness. In particular, this result settles positively a
conjecture of Apt, Blair, and Walker. a 1. INTRODUCTION In this paper, we prove the�…
PROGRAMMING 1989:7:177-191 177 A COMPLETENESS THEOREM FOR SLDNF
RESOLUTION L. CAVEDON AND JW LLOYD D We. prove the completeness of SLDNF
resolution and negation as failure for stratified, normal programs and normal goals, under
the conditions of strictness and allowedness. In particular, this result settles positively a
conjecture of Apt, Blair, and Walker. a 1. INTRODUCTION In this paper, we prove the�…
Abstract
We prove the completeness of SLDNF resolution and negation as failure for stratified, normal programs and normal goals, under the conditions of strickness and allowedness. In particular, this result settles positively a conjecture of Apt, Blair, and Walker.
Elsevier