Giunchiglia, F.; Zaihrayeu, I.; Farazi, F.: Converting classifications into OWL ontologies (2009)
0.03
0.029804429 = product of:
0.1043155 = sum of:
0.021198487 = weight(_text_:with in 4690) [ClassicSimilarity], result of:
0.021198487 = score(doc=4690,freq=4.0), product of:
0.09383348 = queryWeight, product of:
2.409771 = idf(docFreq=10797, maxDocs=44218)
0.038938753 = queryNorm
0.22591603 = fieldWeight in 4690, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.409771 = idf(docFreq=10797, maxDocs=44218)
0.046875 = fieldNorm(doc=4690)
0.08311701 = product of:
0.16623402 = sum of:
0.16623402 = weight(_text_:humans in 4690) [ClassicSimilarity], result of:
0.16623402 = score(doc=4690,freq=4.0), product of:
0.26276368 = queryWeight, product of:
6.7481275 = idf(docFreq=140, maxDocs=44218)
0.038938753 = queryNorm
0.63263696 = fieldWeight in 4690, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
6.7481275 = idf(docFreq=140, maxDocs=44218)
0.046875 = fieldNorm(doc=4690)
0.5 = coord(1/2)
0.2857143 = coord(2/7)
- Abstract
- Classification schemes, such as the DMoZ web directory, provide a convenient and intuitive way for humans to access classified contents. While being easy to be dealt with for humans, classification schemes remain hard to be reasoned about by automated software agents. Among other things, this hardness is conditioned by the ambiguous na- ture of the natural language used to describe classification categories. In this paper we describe how classification schemes can be converted into OWL ontologies, thus enabling reasoning on them by Semantic Web applications. The proposed solution is based on a two phase approach in which category names are first encoded in a concept language and then, together with the structure of the classification scheme, are converted into an OWL ontology. We demonstrate the practical applicability of our approach by showing how the results of reasoning on these OWL ontologies can help improve the organization and use of web directories.
Giunchiglia, F.; Villafiorita, A.; Walsh, T.: Theories of abstraction (1997)
0.01
0.011739651 = product of:
0.041088775 = sum of:
0.019986123 = weight(_text_:with in 4476) [ClassicSimilarity], result of:
0.019986123 = score(doc=4476,freq=2.0), product of:
0.09383348 = queryWeight, product of:
2.409771 = idf(docFreq=10797, maxDocs=44218)
0.038938753 = queryNorm
0.21299566 = fieldWeight in 4476, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.409771 = idf(docFreq=10797, maxDocs=44218)
0.0625 = fieldNorm(doc=4476)
0.021102654 = product of:
0.042205308 = sum of:
0.042205308 = weight(_text_:22 in 4476) [ClassicSimilarity], result of:
0.042205308 = score(doc=4476,freq=2.0), product of:
0.13635688 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.038938753 = queryNorm
0.30952093 = fieldWeight in 4476, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=4476)
0.5 = coord(1/2)
0.2857143 = coord(2/7)
- Abstract
- Describes the types of representations used in different theories of abstractions. Shows how the type of mapping between these representations has been increasingly generalised. Discusses desirable properties preserved by such mappings and identifies how these properties are influenced by the mappings and the presentations defined. Surveys programs made in understanding the complexity reduction associated with abstraction. Focuses on formal models of how abstraction reduces the search space. Presents some of the systems that implement abstraction. shows how the efforts in this area have focused on the mechanisation of languages for the declarative representation of abstraction.
- Date
- 1.10.2018 14:13:22
