This paper deals with analogical transfer in the framework of the representation language RDFS. The application of analogical transfer to case-based reasoning consists in reusing the problem-solution dependency to the context of the target problem; thus it is a general approach to adaptation. RDFS is a representation language that is a standard of the semanticWeb; it is based on RDF, a graphical representation of data, completed by an entailment relation. A dependency is therefore represented as a graph representing complex links between a problem and a solution, and analogical transfer uses, in particular, RDFS entailment. This research work is applied (and inspired from) the issue of cocktail name adaptation: given a cocktail and a way this cocktail is adapted by changing its ingredient list, how can the cocktail name be modified?.
CITATION STYLE
Kiani, N., Lieber, J., Nauer, E., & Schneider, J. (2016). Analogical transfer in RDFS, application to cocktail name adaptation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9969 LNAI, pp. 218–233). Springer Verlag. https://doi.org/10.1007/978-3-319-47096-2_15
Mendeley helps you to discover research relevant for your work.