Skip to main content

Semantic Matchmaking and Ranking: Beyond Deduction in Retrieval Scenarios

  • Conference paper
Web Reasoning and Rule Systems (RR 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7497))

Included in the following conference series:

  • 683 Accesses

Abstract

Matchmaking can be basically seen as the process of computing a ranked list of resources with respect to a given query. Semantic matchmaking can be hence described as the process of computing such ordered list also taking into account the semantics of resources description and of the query, provided with reference to a logic theory (an ontology, a set of rules, etc.) [3]. A matchmaking step is fundamental in a number of retrieval scenarios spanning from (Web) service discovery and composition to e-commerce transactions up to recruitment in human resource management for task assignment, just to cite a few of them. Also in interactive exploratory tasks, matchmaking and ranking play a fundamental role in the selection of relevant resources to be presented to the user and, in case, further explored. In all the above mentioned frameworks, the user query may contain only hard (strict) requirements or may represent also her preferences. We will see how to handle both cases while computing the ranked list of most promising resources.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Colucci, S., Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M.: A Uniform Tableaux-Based Method for Concept Abduction and Contraction in Description Logics. In: ECAI 2004, pp. 975–976 (2004)

    Google Scholar 

  2. Colucci, S., Di Noia, T., Di Sciascio, E., Donini, F.M., Ragone, A.: A unified framework for non-standard reasoning services in description logics. In: ECAI 2010, pp. 479–484 (2010)

    Google Scholar 

  3. Colucci, S., Di Noia, T., Pinto, A., Ragone, A., Ruta, M., Tinelli, E.: A non-monotonic approach to semantic matchmaking and request refinement in e-marketplaces. IJEC 12(2), 127–154 (2007)

    Google Scholar 

  4. Di Noia, T., Di Sciascio, E., Donini, F.M.: Extending Semantic-Based Matchmaking via Concept Abduction and Contraction. In: Motta, E., Shadbolt, N.R., Stutt, A., Gibbins, N. (eds.) EKAW 2004. LNCS (LNAI), vol. 3257, pp. 307–320. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Di Noia, T., Di Sciascio, E., Donini, F.M.: Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach. JAIR 29, 269–307 (2007)

    MATH  Google Scholar 

  6. Di Noia, T., Di Sciascio, E., Donini, F.M.: Semantic matchmaking via non-monotonic reasoning: the mamas-tng matchmaking engine. Communications of SIWN 5, 67–72 (2008)

    Google Scholar 

  7. Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M.: A system for principled Matchmaking in an electronic marketplace. IJEC 8(4), 9–37 (2004)

    Google Scholar 

  8. Di Noia, T., Di Sciascio, E., Donini, F.M.: Computing information minimal match explanations for logic-based matchmaking. In: WI/IAT 2009, pp. 411–418 (2009)

    Google Scholar 

  9. Fishburn, P.C.: Interdependence and additivity in multivariate, unidimensional expected utility theory. International Economic Review 8, 335–342 (1967)

    Article  MATH  Google Scholar 

  10. Li, L., Horrocks, I.: A Software Framework for Matchmaking Based on Semantic Web Technology. IJEC 8(4), 39–60 (2004)

    Google Scholar 

  11. Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. Journal of Economic Theory 29(2), 265–281 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ragone, A., Di Noia, T., Di Sciascio, E., Donini, F.M.: Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces. J. AAMAS 16(3), 249–270 (2008)

    Google Scholar 

  13. Ragone, A., Straccia, U., Di Noia, T., Di Sciascio, E., Donini, F.M.: Fuzzy matchmaking in e-marketplaces of peer entities using Datalog. FSS 10(2), 251–268 (2009)

    MathSciNet  Google Scholar 

  14. Ragone, A., Di Noia, T., Donini, F.M., Di Sciascio, E., Wellman, M.P.: Computing Utility from Weighted Description Logic Preference Formulas. In: Baldoni, M., Bentahar, J., van Riemsdijk, M.B., Lloyd, J. (eds.) DALT 2009. LNCS, vol. 5948, pp. 158–173. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Ragone, A., Di Noia, T., Donini, F.M., Di Sciascio, E., Wellman, M.P.: Weighted Description Logics Preference Formulas for Multiattribute Negotiation. In: Godo, L., Pugliese, A. (eds.) SUM 2009. LNCS, vol. 5785, pp. 193–205. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Tintarev, N., Masthoff, J.: Designing and Evaluating Explanations for Recommender Systems. In: Recommender Systems Handbook, pp. 479–510 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Noia, T. (2012). Semantic Matchmaking and Ranking: Beyond Deduction in Retrieval Scenarios. In: Krötzsch, M., Straccia, U. (eds) Web Reasoning and Rule Systems. RR 2012. Lecture Notes in Computer Science, vol 7497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33203-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33203-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33202-9

  • Online ISBN: 978-3-642-33203-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics