Eklund. P.W.: Logic-based networks : concept graphs and conceptual structures (2000)
0.00
0.0015795645 = product of:
0.003159129 = sum of:
0.003159129 = product of:
0.006318258 = sum of:
0.006318258 = weight(_text_:a in 5084) [ClassicSimilarity], result of:
0.006318258 = score(doc=5084,freq=6.0), product of:
0.04772363 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.041389145 = queryNorm
0.13239266 = fieldWeight in 5084, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=5084)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Logic-based networks are semantic networks that support reasoning capabilities. In this paper, knowledge processing within logicbased networks is viewed as three stages. The first stage involves the formation of concepts and relations: the basic primitives with which we wish to formulate knowledge. The second stage involves the formation of wellformed formulas that express knowledge about the primitive concepts and relations once isolated. The final stage involves efficiently processing the wffs to the desired end. Our research involves each of these steps as they relate to Sowa's conceptual structures and Wille's concept lattices. Formal Concept Analysis gives us a capability to perform concept formation via symbolic machine learning. Concept(ual) Graphs provide a means to describe relational properties between primitive concept and relation types. Finally, techniques from other areas of computer science are required to compute logic-based networks efficiently. This paper illustrates the three stages of knowledge processing in practical terms using examples from our research
- Type
- a
