We investigate the declarative semantics of deductive databases and logic
programs. We introduce the class of perfect models of a deductive database and
argue that this class of models—enjoying many of the properties of the class of
minimal models—provides a correct intended semantics for such databases, in-
corporating a natural form of the closed-world assumption.
We extend the notion of stratified logic programs onto the class of deduc-
tive databases, and we prov ...
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.