In a generic semantic-based matchmaking process, given a request, it is desirable to obtain a ranked list of compatible services/re-sources/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 this 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.
|Titolo:||Match'n'Date: Semantic Matchmaking for Mobile Dating in P2P Environments|
|Data di pubblicazione:||2008|
|Nome del convegno:||2nd International Workshop on Service Matchmaking and Resource Retrieval in the Semantic Web|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|