Abstract
In this chapter, we show how to extend multi-level secure, lineage and disjunctive databases in order to allow for the representation of incomplete predicates by means of bitables. While the resulting systems of MLS factbases and lineage factbases are novelties, the system of disjunctive factbases corresponds to ‘extended disjunctive logic programs’.
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.
Notes
The relationship between disjunctive factbases and Belnap’s ‘epistemic states’ is discussed in Wagner, 1996a.
Without the completeness assumption there are 3 tedium non datur disjunctions formed with m(P), r(A), and r(P), while with the completeness assumption there is only one such disjunction: m(P)V -m(P).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wagner, G. (1998). Further Examples of Non-Positive Knowledge Systems. In: Foundations of Knowledge Systems. The Kluwer International Series on Advances in Database Systems, vol 13. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5723-4_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5723-4_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7621-7
Online ISBN: 978-1-4615-5723-4
eBook Packages: Springer Book Archive