Skip to main content

Surmise Systems

  • Chapter
  • First Online:
Learning Spaces

Abstract

When a knowledge structure is a quasi ordinal space, it can be faithfully represented by its surmise relation (cf. Theorem 3.8.3). In fact, as illustrated by Example 3.7.4, a fnite 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 insufficient. In this chapter, we study the ‘surmise system,’ a concept generalizing that of a surmise relation, and allowing more than one possible learning ‘foundation’1 for an item2. One of the two main results of this chapter is Theorem 5.2.5 which establishes, in the style of Theorem 3.8.3 for quasi ordinal spaces, a one-to-one correspondence between knowledge spaces and surmise systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • E. Szpilrajn. Sur l’extension de l’ordre partiel. Fundamenta Mathematicae, 16:386–389, 1930.

    MATH  Google Scholar 

  • E. Rich. Artificial Intelligence. MacGraw-Hill, Singapore, 1983.

    Google Scholar 

  • A. Barr and E.A. Feigenbaum. The Handbook of Artificial Intelligence. Pittman, London, 1981.

    MATH  Google Scholar 

  • M. Koppen. On alternative representations for knowledge spaces. Mathematical Social Sciences, 36:127–143, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  • Cl. Flament. L’Analyse Booléenne des Questionnaires. Mouton, Paris-The Haguen, 1976.

    Google Scholar 

  • J.-P. Doignon and J.-Cl. Falmagne. Spaces for the Assessment of Knowledge. International Journal of Man-Machine Studies, 23:175–196, 1985.

    Article  MATH  Google Scholar 

  • M. Koppen. Ordinal Data Analysis: Biorder Representation and Knowledge Spaces. Doctoral dissertation, Katholieke Universiteit te Nijmegen, Nijmegen, The Netherlands, 1989.

    Google Scholar 

  • W.T. Trotter. Combinatorics and Partially Ordered Sets: Dimension Theory. The Johns Hopkins University Press, Baltimore and London, 1992.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jean-Claude Falmagne .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Falmagne, JC., Doignon, JP. (2011). Surmise Systems. In: Learning Spaces. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01039-2_5

Download citation

Publish with us

Policies and ethics