In this section we introduce our notation and basic definitions and describe the
class of general logic programs that we shall be considering in this paper. We
define safe negation and exclude programs with unsafe negation from further
consideration.
DEFINITION 1
A general logic program is a set of general rules that may have both positive
and negative subgoals. A goal consists of a predicate symbol with terms as ar-
guments, and may also be thought of as an atomic formula, or atom. A
general rule is written with its
head,
or conclusion on the left ...
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.