Lex, W.: ¬A representation of concepts for their computerization (1987)
0.01
0.013694874 = product of:
0.061626934 = sum of:
0.018861448 = weight(_text_:of in 618) [ClassicSimilarity], result of:
0.018861448 = score(doc=618,freq=14.0), product of:
0.05157766 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03298316 = queryNorm
0.36569026 = fieldWeight in 618, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0625 = fieldNorm(doc=618)
0.042765487 = product of:
0.085530974 = sum of:
0.085530974 = weight(_text_:etc in 618) [ClassicSimilarity], result of:
0.085530974 = score(doc=618,freq=2.0), product of:
0.17865302 = queryWeight, product of:
5.4164915 = idf(docFreq=533, maxDocs=44218)
0.03298316 = queryNorm
0.47875473 = fieldWeight in 618, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4164915 = idf(docFreq=533, maxDocs=44218)
0.0625 = fieldNorm(doc=618)
0.5 = coord(1/2)
0.22222222 = coord(2/9)
- Abstract
- A lattice theoretical description of concept hierarchies is developed using for attributes the terms "given", "negated", "open" and "impossible" as the truth-values of a four-valued logic. Similar to the theory of B. Ganter and R. Wille so does this framework permit a precise representation of the usual interdependences in a field of related concepts - such as superconcepts, subconcept, contrary concepts etc. -, whenever the concepts under consideration can be sufficiently described by the presence or absence of certain attributes ...
