pleteness results for non-ground categorical programs, one should probably aim
only at θ-completeness for allowed queries. I do not know of any results of this
kind apart from the ones for definite Horn programs in Theorem 28.
Semantics
for
Negation
in Terms of Special Classes
of Models
We saw in the section on the closed world assumption that cwa(P) was incon-
sistent for any program Ρ implying indefinite information about ground atoms,
and that it was consistent only if Ρ had a least Herbrand model. In attempting
to find a useful weaker assumption that would be consistent for all consistent
program ...
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.