Skip to Main content Skip to Navigation
Conference papers

Analogical Transfer in RDFS, Application to Cocktail Name Adaptation

Nadia Kiani 1 Jean Lieber 2, 1, 3 Emmanuel Nauer 1, 3, 2 Jordan Schneider 1
2 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : 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 semantic Web; 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?
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Jean Lieber <>
Submitted on : Tuesday, December 6, 2016 - 3:23:57 PM
Last modification on : Tuesday, October 20, 2020 - 10:31:33 AM
Long-term archiving on: : Monday, March 20, 2017 - 8:50:45 PM


Files produced by the author(s)




Nadia Kiani, Jean Lieber, Emmanuel Nauer, Jordan Schneider. Analogical Transfer in RDFS, Application to Cocktail Name Adaptation. International Conference on Case-Based Reasoning (ICCBR-2016), Oct 2016, Atlanta, United States. pp.218 - 233, ⟨10.1007/978-3-319-47096-2_15⟩. ⟨hal-01410237⟩



Record views


Files downloads