Abstract
In this chapter, we study various forms of negation. Since only positive information can be a logical consequence of a program, special rules are needed to deduce negative information. The most important of these rules are the closed world assumption and the negation as failure rule. The major results of this chapter are the soundness and completeness of the negation as failure rule.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 J. W. Lloyd
About this chapter
Cite this chapter
Lloyd, J.W. (1984). Negation. In: Foundations of Logic Programming. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96826-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-96826-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-96828-0
Online ISBN: 978-3-642-96826-6
eBook Packages: Springer Book Archive