A logic-based approach for matching user profiles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3215, Issue , 2004, Pages 187-195

  Calì, Andrea ^a,b   Calvanese, Diego ^b   Colucci, Simona ^c   Di Noia, Tommaso ^c   Donini, Francesco M ^d  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^c POLITECNICO DI BARI   (Italy)

^d UNIVERSITY OF TUSCIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DEMAND AND SUPPLY; LOGIC-BASED APPROACH; LOGICAL FRAMEWORKS; USER PROFILE;

KNOWLEDGE BASED SYSTEMS;

EID: 84975453491     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30134-9_27     Document Type: Conference Paper

References (13)

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