Advertisement

A Logic-Based Approach for Matching User Profiles

  • Andrea Calì
  • Diego Calvanese
  • Simona Colucci
  • Tommaso Di Noia
  • Francesco M. Donini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3215)

Abstract

Several applications require the matching of user profiles, e.g., job recruitment or dating systems. In this paper we present a logical framework for specifying user profiles that allows profile description to be incomplete in the parts that are unavailable or are considered irrelevant by the user. We present an algorithm for matching demands and supplies of profiles, taking into account incompleteness of profiles and incompatibility between demand and supply. We specialize our framework to dating services; however, the same techniques can be directly applied to several other contexts.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)zbMATHGoogle Scholar
  2. 2.
    Baader, F., Hanschke, P.: A schema for integrating concrete domains into concept languages. In: Proc. of IJCAI 1991, pp. 452–457 (1991)Google Scholar
  3. 3.
    Borgida, A., Patel-Schneider, P.F.: A semantics and complete algorithm for subsumption in the CLASSIC description logic. J. of Artificial Intelligence Research 1, 277–308 (1994)zbMATHGoogle Scholar
  4. 4.
    Colucci, S., Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M.: Concept abduction and contraction in description logics. In: Proc. of DL 2003. CEUR Electronic Workshop Proceedings (2003), http://ceur-ws.org/Vol-81/
  5. 5.
    Colucci, S., Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M., Mottola, M.: A formal approach to ontology-based semantic match of skills descriptions. J. of Universal Computer Science, Special issue on Skills Management (2003)Google Scholar
  6. 6.
    Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M.: Abductive matchmaking using description logics. In: Proc. of IJCAI 2003, pp. 337–342 (2003)Google Scholar
  7. 7.
    Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M.: A system for principled matchmaking in an electronic marketplace. In: Proc. of WWW 2003, May 20–24, pp. 321–330 (2003)Google Scholar
  8. 8.
    Galil, Z.: Efficient algorithms for finding maximum matching in graphs. ACM Computing Surveys 18(1), 23–38 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research. McGraw-Hill, New York (1995)Google Scholar
  10. 10.
    Kennington, J., Wang, Z.: An empirical analysis of the dense assignment problem: Sequential and parallel implementations. ORSA Journal on Computing 3(4), 299–306 (1991)zbMATHGoogle Scholar
  11. 11.
    Kuokka, D., Harada, L.: Integrating information via matchmaking. J. of Intelligent Information Systems 6, 261–279 (1996)CrossRefGoogle Scholar
  12. 12.
    Sycara, K., Widoff, S., Klusch, M., Lu, J.: LARKS: Dynamic matchmaking among heterogeneus ssoftware agents in cyberspace. Autonomous agents and multi-agent systems 5, 173–203 (2002)CrossRefGoogle Scholar
  13. 13.
    Veit, D., Müller, J.P., Schneider, M., Fiehn, B.: Matchmaking for autonomous agents in electronic marketplaces. In: Proc. of AGENTS 2001, pp. 65–66. ACM, New York (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Andrea Calì
    • 1
    • 2
  • Diego Calvanese
    • 2
  • Simona Colucci
    • 3
  • Tommaso Di Noia
    • 3
  • Francesco M. Donini
    • 4
  1. 1.Dip. di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomaItaly
  2. 2.Faculty of Computer ScienceFree University of Bolzano/BozenBolzanoItaly
  3. 3.Dip. di Elettrotecnica ed Elettronica, Politecnico di BariBariItaly
  4. 4.Facoltà di Scienze PoliticheUniversità della TusciaViterboItaly

Personalised recommendations