Abstract
In this chapter, we summarize the basic concepts of positive knowledge systems and call a knowledge system vivid if it is upward compatible with A,the system of relational databases. We also discuss the difference between knowledge update and knowledge integration.
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 formulation of a knowledge system in terms of query and input processing was already implicit in Belnap, 1977. In Levesque, 1984 it was proposed as a ‘functional approach to knowledge representation’. In Wagner, 1994b; Wagner, 1995 the concept of knowledge systems was further extended and used as an integrating framework for knowledge representation and logic programming.
The usual way to compare the information content of two knowledge bases in standard logic by checking the inclusion of consequences: X ≤ Y if C(X) ⊑ C(Y), does not work in a general (possibly nonmonotonic) setting.
The name is adopted from Belnap, 1977.
Or, rather exotically, if all inputs are reductive and all queries are ‘antipersistent’, i.e. preserved under information decrease.
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). Principles of 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_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5723-4_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7621-7
Online ISBN: 978-1-4615-5723-4
eBook Packages: Springer Book Archive