and is independent of the stratification, is characterized in two ways. One is
based on a fixed point theory of nonmonotonic operators and the other on an
abstract declarative characterization. The back-chaining interpreter also deter-
mines the standard model. Finally, we prove the consistency of Clark's
completion for stratified programs and attempt to clarify the sources of some
previously reported difficulties with negation in logic programming.
Introduction
The aim of this paper is to provide a formal basis for separating declarative and
procedural matters in an extension of logic programming allowing negation in ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.