Search (1 results, page 1 of 1)

Did you mean:
editor's%3a%22Eigenbrodt%2c O. u. R. stang%22 1
editor's%3a%22Eigenbrodt%2c O. u. R. stand%22 1
editores%3a%22Eigenbrodt%2c O. u. R. stang%22 1
editor's%3a%22Eigenbrodt%2c O. u. R. strang%22 1
editors%3a%22Eigenbrodt%2c O. u. R. stang%22 1

Lex, W.: ¬A representation of concepts for their computerization (1987) 0.01
```
0.007962625 = product of:
  0.039813124 = sum of:
    0.039813124 = weight(_text_:r in 618) [ClassicSimilarity], result of:
      0.039813124 = score(doc=618,freq=2.0), product of:
        0.13607219 = queryWeight, product of:
          3.3102584 = idf(docFreq=4387, maxDocs=44218)
          0.041106213 = queryNorm
        0.29258826 = fieldWeight in 618, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3102584 = idf(docFreq=4387, maxDocs=44218)
          0.0625 = fieldNorm(doc=618)
  0.2 = coord(1/5)
```
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 ...