Skip to main content
SpringerLink
Log in

Modeling, Matching and Ranking Services Based on Constraint Hardness

  • Conference paper
Business Process Management Workshops (BPM 2006)

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

Included in the following conference series:

  • 1740 Accesses

Abstract

A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expressing constraints in service descriptions of different strengths, i.e. Hard and Soft Constraints. Semantic service discovery can be performed by matching DL descriptions, expressing both Hard and Soft constraints, and exploiting DL inferences. Additionally, a method for solving the problem of ranking services is proposed which is based on the use of a semantic similarity measure for DL. This method can rank (matched) service descriptions on the grounds of their semantic similarity w.r.t. the service request, by preferring those that are able to better satisfy both Hard and Soft Constraints.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  2. Bock, H.H.: Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data. Springer, Heidelberg (1999)

    Google Scholar 

  3. Calì, A., Calvanese, D., Colucci, S., Di Noia, T., Donini, F.M.: A description logic based approach for matching user profiles. In: Description Logics (2004)

    Google Scholar 

  4. d’Amato, C., Fanizzi, N., Esposito, F.: A semantic similarity measure for expressive description logics. In: Pettorossi, A. (ed.) Proceedings of Convegno Italiano di Logica Computazionale, CILC 2005, Rome, Italy (2005)

    Google Scholar 

  5. Gonzales-Castillo, J., Trastour, D., Bartolini, C.: Description logics for matchmaking of services. In: Proc. of KI 2001 Workshop on Applications of Description Logics, vol. 44 (2001)

    Google Scholar 

  6. Grimm, S., Motik, B., Preist, C.: Variance in e-business service discovery. In: Proceedings of the ISWC Workshop on Semantic Web Services (2004)

    Google Scholar 

  7. Li, L., Horrocks, I.: A software framework for matchmaking based on semantic web technology. In: WWW 2003: Proceedings of the 12th international conference on World Wide Web, pp. 331–339. ACM Press, New York (2003)

    Google Scholar 

  8. McIlraith, S.A., Martin, D.L.: Bringing semantics to web services. IEEE Intelligent Systems 18(1), 90–93 (2003)

    Article  Google Scholar 

  9. Di Noia, T., Di Sciascio, E., Donini, F.M., Mongiello, M.: A system for principled matchmaking in an electronic marketplace. In: WWW, pp. 321–330 (2003)

    Google Scholar 

  10. Paolucci, M., Kawamura, T., Payne, T.R., Sycara, K.P.: Semantic matching of web services capabilities. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 333–347. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Paolucci, M., Sycara, K.P.: Autonomous semantic web services. IEEE Internet Computing 7(5), 34–41 (2003)

    Article  Google Scholar 

  12. Preist, C.: A conceptual architecture for semantic web services. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 395–409. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Trastour, D., Bartolini, C., Gonzalez-Castillo, J.: A semantic web approach to service description for matchmaking of services. In: SWWS, pp. 447–461 (2001)

    Google Scholar 

  14. Trastour, D., Bartolini, C., Preist, C.: Semantic web support for the business-to-business e-commerce lifecycle. In: WWW 2002: Proceedings of the 11th international conference on World Wide Web, pp. 89–98. ACM Press, New York (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bari, Italy

    Claudia d’Amato

  2. ISWeb, University of Koblenz-Landau, Germany

    Steffen Staab

Authors
  1. Claudia d’Amato
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steffen Staab
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Knowledge and Business Engineering, University of Vienna, Rathausstrasse 19/9, A-1010, Vienna, Austria

    Johann Eder

  2. Distributed Systems Group, Information Systems Institute, Vienna University of Technology, Austria

    Schahram Dustdar

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

d’Amato, C., Staab, S. (2006). Modeling, Matching and Ranking Services Based on Constraint Hardness. In: Eder, J., Dustdar, S. (eds) Business Process Management Workshops. BPM 2006. Lecture Notes in Computer Science, vol 4103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11837862_44

Download citation

  • DOI: https://doi.org/10.1007/11837862_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38444-1

  • Online ISBN: 978-3-540-38445-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation