Chapter

Flexible Query Answering Systems

Volume 3055 of the series Lecture Notes in Computer Science pp 282-294

Semantic Web Services Discovery Regarded as a Constraint Satisfaction Problem

  • Salima BenbernouAffiliated withLIRIS (Lyon Research Center for Images and Intelligent Information Systems), Université Claude Bernard Lyon 1
  • , Etienne CanaudAffiliated withLIRIS (Lyon Research Center for Images and Intelligent Information Systems), Université Claude Bernard Lyon 1
  • , Simone PimontAffiliated withLIRIS (Lyon Research Center for Images and Intelligent Information Systems), Université Claude Bernard Lyon 1

* Final gross prices may vary according to local VAT.

Get Access

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.