Abstract
How can we economically describe a state in a knowledge structure? The question is inescapable because, as pointed out earlier, realistic states will typically be quite large. In such cases, it is impractical to describe a state by giving the full list of items that it contains. It is also unnecessary: because of the redundancy in many real-life knowledge structures1, a state will often be characterizable by a relatively small set of features. This idea is not new.In Chapter 4, we proved that any state in a well-graded knowledge structure could be fully described by simply listing its inner and outer fringes (cf. Theorem 4.1.7 and Remark 4.1.8(a)). Here, we consider this issue more systematically. This chapter is somewhat eccentric to the rest of this book and can be skipped without harm at first reading. We begin by illustrating the main ideas in the context of a simple example encountered earlier.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freemann, 1979.
G. Rozenberg and A. Salomaa, editors. Handbook of Formal Language Theory, Vol. 1-3. Springer-Verlag, Berlin, Heidelberg, and New York, 1997.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Falmagne, JC., Doignon, JP. (2011). Descriptive and Assessment Languages*. In: Learning Spaces. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01039-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-01039-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01038-5
Online ISBN: 978-3-642-01039-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)