Skip to Main Content
Foundations of Deductive Databases and Logic Programming
book

Foundations of Deductive Databases and Logic Programming

by Jack Minker
May 2014
Intermediate to advanced content levelIntermediate to advanced
752 pages
35h 3m
English
Morgan Kaufmann
Content preview from Foundations of Deductive Databases and Logic Programming
Chapter
3:
Negation
as
Failure
Using
Tight
Derivations
General
Logic
Programs
and Safe
Negation
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.
Start your free trial

You might also like

Concepts and Semantics of Programming Languages 1

Concepts and Semantics of Programming Languages 1

Therese Hardin, Mathieu Jaume, Francois Pessaux, Veronique Viguie Donzeau-Gouge
Handbook of Constraint Programming

Handbook of Constraint Programming

Francesca Rossi, Peter van Beek, Toby Walsh

Publisher Resources

ISBN: 9781483221120