skip to main content
10.1145/952532.952649acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Semantic matchmaking in a P-2-P electronic marketplace

Published: 09 March 2003 Publication History

Abstract

Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are peers in the transaction. Peer-to-Peer (P-2-P) e-commerce calls for an infrastructure treating in a uniform way supply and demand, which should base the match on a common ontology for describing both supply and demand. Knowledge representation --- in particular description logics --- can deal with this uniform treatment of knowledge from vendors and customers, by modelling both as generic concepts to be matched. We propose a logical approach to supply-demand matching in P-2-P e-commerce, which allows us to clearly distinguish between exact, potential and partial match, and to define a ranking within the categories. The approach is deployed in a prototype system implemented for a particular case study (but easily generalizable) and is based on Classic, a well-known knowledge representation system.

References

[1]
Y. Arens, C. A. Knoblock, and W. Shen. Query Reformulation for Dynamic Information Integration. J. of Intelligent Information Systems, 6:99--130, 1996.
[2]
A. Borgida et al. CLASSIC: A Structural Data Model for Objects. In Proc. of ACM SIGMOD, pages 59--67, 1989.
[3]
A. Borgida and P. F. Patel-Schneider. A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic. JAIR, 1:277--308, 1994.
[4]
F. Casati and M. C. Shan. Dynamic and Adaptive Composition of E-Services. Information Systems, 26:143--163, 2001.
[5]
E. Di Sciascio et al. A Knowledge-Based System for Person-to-Person E-Commerce. In Proc. Workshop on Applications of Description Logics (KI 2001), 2001.
[6]
D. Fensel et al. OIL: An Ontology Infrastructure for the Semantic Web. IEEE Intelligent Systems, 16(2):38--45, 2001.
[7]
T. Finin et al. KQML as an Agent Communication Language. In Proc. of CIKM'94, pages 456--463. ACM, 1994.
[8]
Y. Gil and S. Ramachandran. PHOSPHORUS: a Task based Agent Matchmaker. In Proc. AGENTS '01, pages 110--111. ACM, 2001.
[9]
J. Gonzales-Castillo, D. Trastour, and C. Bartolini. Description Logics for Matchmaking of Services. In Proc. of Workshop on Application of Description Logics (KI 2001), 2001.
[10]
Y. Hoffner et al. Distribution Issues in the Design and Implementation of a Virtual Market Place. Computer Networks, 32:717--730, 2000.
[11]
N. Jacobs and R. Shea. Carnot and Infosleuth --- Database Technology and the Web. In Proc. of ACM SIGMOD, pages 443--444. ACM, 1995.
[12]
N. Karacapilidis and P. Moraitis. Building an Agent-Mediated Electronic Commerce System with Decision Analysis Features. Decision Support Systems, 32:53--69, 2001.
[13]
D. Kuokka and L. Harada. Integrating Information Via Matchmaking. J. of Intelligent Information Systems, 6:261--279, 1996.
[14]
P. Maes, R. Guttman, and A. Moukas. Agents that Buy and Sell. Comm. of the ACM, 42(3):81--91, 1999.
[15]
M. Paolucci et al. Semantic Matching of Web Services Capabilities. In The Semantic Web - ISWC 2002, number 2342 in LNCS, pages 333--347. Springer-Verlag, 2002.
[16]
P. Pu and B. Faltings. Enriching Buyers' Experience. CHI Letters, 2(1), 2000.
[17]
S. Avancha, A. Joshi, and T. Finin. Enhanced Service Discovery in Bluetooth. IEEE Computer, pages 96--99, 2002.
[18]
K. Sycara et al. LARKS: Dynamic Matchmaking Among Heterogeneus Ssoftware Agents in Cyberspace. Autonomous agents and multi-agent systems, 5:173--203, 2002.
[19]
D. Trastour, C. Bartolini, and C. Priest. Semantic Web Support for the Business-to-Business E-Commerce Lifecycle. In Proc. WWW '02, pages 89--98. ACM, 2002.
[20]
H. Wang, S. Liao, and L. Liao. Modeling Constraint-Based Negotiating Agents. Decision Support Systems, 33:201--217, 2002.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '03: Proceedings of the 2003 ACM symposium on Applied computing
March 2003
1268 pages
ISBN:1581136242
DOI:10.1145/952532
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 March 2003

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. description logics
  2. knowledge representation
  3. matchmaking
  4. web services

Qualifiers

  • Article

Conference

SAC03
Sponsor:
SAC03: ACM Symposium on Applied Computing
March 9 - 12, 2003
Florida, Melbourne

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media