Semantic Web Services Discovery Regarded as a Constraint Satisfaction Problem

  • Salima Benbernou
  • Etienne Canaud
  • Simone Pimont
Conference paper

DOI: 10.1007/978-3-540-25957-2_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3055)
Cite this paper as:
Benbernou S., Canaud E., Pimont S. (2004) Semantic Web Services Discovery Regarded as a Constraint Satisfaction Problem. In: Christiansen H., Hacid MS., Andreasen T., Larsen H.L. (eds) Flexible Query Answering Systems. FQAS 2004. Lecture Notes in Computer Science, vol 3055. Springer, Berlin, Heidelberg

Abstract

The web services discovery is a fundamental problem in semantic web services. The problem is to find services that can be combined to form an admissible answer to a query. At the same time, constraint satisfaction is recognized as a fundamental problem in artificial intelligence. In this paper, we will investigate the connection between both problems. We will show that they are the same problem despite their very different formulation. The reason is that they can be recast as the following fundamental algebraic problem: given two relational structures A and B, is there a homomorphism h:AB? In our approach, the proposed homomorphism is a labelled graph homomorphism. The latter is based on simple conceptual graph which is considered as the kernel of most knowledge representation formalism built upon Sowa’s model. Reasoning in this model can be expressed by a graph homomorphism.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Salima Benbernou
    • 1
  • Etienne Canaud
    • 1
  • Simone Pimont
    • 1
  1. 1.LIRIS (Lyon Research Center for Images and Intelligent Information Systems)Université Claude Bernard Lyon 1VilleurbanneFrance

Personalised recommendations