Search (1 results, page 1 of 1)

Did you mean:
editor's%3a%22Ohly%2c P.%2c G. rahmstorf u. A. sigel%22 1
editor's%3a%22Ohly%2c P.%2c G. rahmstorf u. A. siegel%22 1
editor's%3a%22Ohly%2c P.%2c G. rahmtorf u. A. sigel%22 1
editores%3a%22Ohly%2c P.%2c G. rahmstorf u. A. sigel%22 1
editores%3a%22Ohly%2c P.%2c G. rahmstorf u. A. siegel%22 1

Lex, W.: ¬A representation of concepts for their computerization (1987) 0.00
```
0.0015233682 = product of:
  0.010663576 = sum of:
    0.010663576 = weight(_text_:a in 618) [ClassicSimilarity], result of:
      0.010663576 = score(doc=618,freq=12.0), product of:
        0.04271548 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.03704574 = queryNorm
        0.24964198 = fieldWeight in 618, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=618)
  0.14285715 = coord(1/7)
```
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 ...

Type

a