Abstract
When a knowledge structure is a quasi ordinal space, it can be faithfully represented by its surmise relation (cf. Theorem 1.49). In fact, as illustrated by Example 1.46, an ordinal space is completely recoverable from the Hasse diagram of the surmise relation. However, for knowledge structures in general, and even for knowledge spaces, the information provided by the surmise relation may be incomplete. In this chapter, we introduce the ‘surmise system’, a concept generalizing that of a surmise relation, and allowing more than one possible learning history for an item1. We then derive, in the style of Theorem 1.49, a one-to-one correspondence between knowledge spaces and surmise systems. The surmise systems are closely related to the AND/OR graphs encountered in artificial intelligence. A section of this chapter is devoted to clarifying the relationship between the two concepts. This chapter also contains a discussion of the particular surmise systems which arise from well-graded knowledge spaces. Other highlights are: a generalization of the concept of a Hasse diagram, and a study of intractable ‘cyclic’ histories which leads us to formulate conditions precluding such situations.
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
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Doignon, JP., Falmagne, JC. (1999). Surmise Systems. In: Knowledge Spaces. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58625-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-58625-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64501-6
Online ISBN: 978-3-642-58625-5
eBook Packages: Springer Book Archive