EconPapers    
Economics at your fingertips  
 

Entailments and the Maximal Mesh

Jean-Claude Falmagne () and Jean-Paul Doignon ()
Additional contact information
Jean-Claude Falmagne: University of California, Irvine, Department of Cognitive Sciences, Institute of Mathematical Behavioral Sciences
Jean-Paul Doignon: Université Libre de Bruxelles, Département de Mathématique

Chapter 7 in Learning Spaces, 2011, pp 119-131 from Springer

Abstract: 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.

Keywords: Knowledge Structure; Ordinal Space; Entail Relation; Knowledge Space; Lucky Guess (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-01039-2_7

Ordering information: This item can be ordered from
http://www.springer.com/9783642010392

DOI: 10.1007/978-3-642-01039-2_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2026-05-12
Handle: RePEc:spr:sprchp:978-3-642-01039-2_7