Motivated by the need to extend features of semantic matchmaking between request and offer descriptions, a model is presented that exploits recently proposed non-standard inference services in Description Logics. The model allows to manage negotiable and strict constraints of a request (equivalently of an offer) while performing a matchmaking process, even if both the request and the offer are incompatible -some part of one description is in conflict with the other- and some constraints in one description are not specified in the other one. An algorithm is presented to compute both which part of the request should be retracted and which part of the offer has to be refined in order to make them completely satisfiable with each other
Extending Semantic-Based Matchmaking via Concept Abduction and Contraction / Di Noia, Tommaso; Di Sciascio, Eugenio; Donini, Francesco M.. - STAMPA. - 3257:(2004), pp. 307-320. (Intervento presentato al convegno 14th International Conference on Knowledge Engineering and Knowledge Management, EKAW 2004 tenutosi a Whittlebury Hall, UK nel October 5-8, 2004) [10.1007/978-3-540-30202-5_21].
Extending Semantic-Based Matchmaking via Concept Abduction and Contraction
Tommaso Di Noia;Eugenio Di Sciascio;Francesco M. Donini
2004-01-01
Abstract
Motivated by the need to extend features of semantic matchmaking between request and offer descriptions, a model is presented that exploits recently proposed non-standard inference services in Description Logics. The model allows to manage negotiable and strict constraints of a request (equivalently of an offer) while performing a matchmaking process, even if both the request and the offer are incompatible -some part of one description is in conflict with the other- and some constraints in one description are not specified in the other one. An algorithm is presented to compute both which part of the request should be retracted and which part of the offer has to be refined in order to make them completely satisfiable with each otherI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
