In a generic semantic-based matchmaking process, given a request, it is desirable to obtain a ranked list of compatible services/resources/profiles in order of relevance. Furthermore, a match explanation can provide useful information to modify or refine the original request in a principled way. Though the feasibility of such an approach has been proved with fixed reasoning engines, it is a challenging subject to perform inference tasks on handheld devices. Here we propose abduction and contraction algorithms in Description Logics specifically devised for applications in mobile environments. A simple interaction paradigm based on Bluetooth protocol stack has also been implemented and tested in a mobile dating case study.
Abduction and Contraction for Semantic-based Mobile Dating in P2P Environments / Ruta, Michele; DI NOIA, Tommaso; DI SCIASCIO, Eugenio; Scioscia, Floriano. - (2008), pp. 626-632. (Intervento presentato al convegno IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT '08 tenutosi a Sydney, Australia nel December 9-12 , 2008) [10.1109/WIIAT.2008.413].
Abduction and Contraction for Semantic-based Mobile Dating in P2P Environments
RUTA, Michele;DI NOIA, Tommaso;DI SCIASCIO, Eugenio;SCIOSCIA, Floriano
2008-01-01
Abstract
In a generic semantic-based matchmaking process, given a request, it is desirable to obtain a ranked list of compatible services/resources/profiles in order of relevance. Furthermore, a match explanation can provide useful information to modify or refine the original request in a principled way. Though the feasibility of such an approach has been proved with fixed reasoning engines, it is a challenging subject to perform inference tasks on handheld devices. Here we propose abduction and contraction algorithms in Description Logics specifically devised for applications in mobile environments. A simple interaction paradigm based on Bluetooth protocol stack has also been implemented and tested in a mobile dating case study.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
