Skip to main content

Entailments and the Maximal Mesh

  • Chapter
  • First Online:
Book cover Learning Spaces

Abstract

In practice, how can we build a knowledge structure for a specific body of information? The first step is to select the items forming a domain Q. For real-life applications, we will typically assume this domain to be finite. The second step is then to construct a list of all the subsets of Q that are feasible knowledge states, in the sense that anyone of them could conceivably occur in the population of reference. To secure such a list, we could in principle rely on one or more experts in the particular body of information. However, if no assumption is made on the structure to be uncovered, the only exact method consists in the presentation of all subsets of Q to the expert, so that he can point out the states.

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

  • J.-Cl. Falmagne, M. Koppen, M. Villano, J.-P. Doignon, and L. Johannesen. Introduction to knowledge spaces: how to build, test and search them. Psychological Review, 97:204–224, 1990.

    Article  Google Scholar 

  • C.E. Dowling. Integrating diérent knowledge spaces. In G.H. Fischer and D. Laming, editors, Contributions to Mathematical Psychology, Psychometrics, and Methodology, pages 149–158. Springer-Verlag, Berlin, Heidelberg, and New York, 1994.

    Google Scholar 

  • B. Ganter. Two basic algorithms in concept analysis. (FB4–Preprint, number 831.) TH Darmstadt, 1984.

    Google Scholar 

  • J.-L. Guigues and V. Duquenne. Familles minimales d’implications informatives résultant d’un tableau de données binaires. Mathématiques, Informatique et Sciences Humaines, 97:5–18, 1986.

    MathSciNet  Google Scholar 

  • M. Wild. A theory of finite closure spaces based on implications. Advances in Mathematics, 108:118–139, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Villano. Computerized knowledge assessment: Building the knowledge structure and calibrating the assessment routine. PhD thesis, New York University, New York, 1991. In Dissertation Abstracts International, vol. 552, p. 12B.

    Google Scholar 

  • M. Koppen and J.-P. Doignon. How to build a knowledge space by querying an expert. Journal of Mathematical Psychology, 34:311–331, 1990.

    Article  MATH  MathSciNet  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). Entailments and the Maximal Mesh. In: Learning Spaces. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01039-2_7

Download citation

Publish with us

Policies and ethics