A software framework for matchmaking based on semantic web technology

Li, Lei; Horrocks, Ian

doi:10.1145/775152.775199

Cited by 506 publications

(273 citation statements)

References 17 publications

Supporting

Mentioning

269

Contrasting

Unclassified

Order By: Relevance

“…The OWL+TIME Ontology [9,10] is a very expressive language which is used by semantic-web-based approaches of WSP, such as the Web Ontology Language -Services (OWL-S) [2,13,16].…”

Section: Proposals Based On Semantic Webmentioning

confidence: 99%

An Approach to Temporal-Aware Procurement of Web Services

Martín–Díaz

Ruiz–Cortés

Durán

et al. 2005

Service-Oriented Computing – ICSOC 2007

View full text Add to dashboard Cite

Abstract. In the context of web service procurement (WSP), temporal-awareness refers to managing service demands and offers which are subject to validity periods, i.e. their evaluation depends not only on quality of service (QoS) values but also on time. For example, the QoS of some web services can be considered critical in working hours (9:00 to 17:00 from Monday to Friday) and irrelevant at any other moment. Until now, the expressiveness of such temporal-aware specifications has been quite limited. As far as we know, most proposals have considered validity periods to be composed of a single temporal interval. Other proposals, which could allow more expressive time-dependent specifications, have not performed a detailed study about all the underlying complexities of such approach, in spite of the fact that dealing with complex expressions on temporality is not a trivial task at all. As a matter of fact, it requires a special design of the so-called procurement tasks (consistency and conformance checking, and optimal selection). In this paper, we present a constraint-based approach to temporal-aware WSP. Using constraints allows a great deal of expressiveness, so that not only demands and offers can be assigned validity periods but also their conditions can be assigned (possibly multiple) validity temporal subintervals. Apart from revising the semantics of procurement tasks, which we previously presented in the first edition of the ICSOC conferences, we also introduce the notion of the covering set of a demand, a topic which is closely related to temporality.

show abstract

“…The OWL+TIME Ontology [9,10] is a very expressive language which is used by semantic-web-based approaches of WSP, such as the Web Ontology Language -Services (OWL-S) [2,13,16].…”

Section: Proposals Based On Semantic Webmentioning

confidence: 99%

An Approach to Temporal-Aware Procurement of Web Services

Martín–Díaz

Ruiz–Cortés

Durán

et al. 2005

Service-Oriented Computing – ICSOC 2007

View full text Add to dashboard Cite

show abstract

“…We plan to investigate the extension of ALCK with features of expressive description logics, such as number restrictions, nominals or inverse roles, which proofed to be useful in the context of describing service semantics [17,10]. We also intend to investigate reasoning with arbitrary ALCK knowledge bases and to explore the formalism presented in [6,23], which introduces an additional epistemic operator A, capturing the notion of 'assumption'.…”

Section: Discussionmentioning

confidence: 99%

“…Several approaches to service discovery based on description logics have already been proposed in [26,18,17]. Along these lines, in this paper we extend our work from [10] and present a DL-based approach for modelling semantics of Web Services.…”

Section: Introductionmentioning

confidence: 88%

“…'Satisfiability of concept conjunction' was first proposed in [8,26] and [24], and was subsequently considered in [19,18,17,14,10]. Furthermore, many of these works use 'entailment of concept subsumption', which checks if one of the sets of accepted concrete services is a subset of the other in each possible world.…”

Section: Matching Capability Descriptionsmentioning

confidence: 99%

“…However, as discussed in [10], this inference has not shown to be beneficial for our notion of compatibility between two descriptions S r and S p : we treat concrete services as alternative specifications of service parameters, and thus, having a single concrete service in the extension of the sets is already sufficient for our capability descriptions to be compatible. Subsumption and equivalence matching applied to pairs (S r , S p ) of descriptions has been used for establishing a ranking among service providers in [19,17,14]. However, in our setting the partial subsumption check between two provider descriptions S pA and S pB , defined in [10], provides a more fine-grained ranking based on the options the requester has later on in the service definition phase.…”

Section: Matching Capability Descriptionsmentioning

confidence: 99%

See 2 more Smart Citations

Matching Semantic Service Descriptions with Local Closed-World Reasoning

Grimm

Motik

Preist

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Semantic Web Services were developed with the goal of automating the integration of business processes on the Web. The main idea is to express the functionality of the services explicitly, using semantic annotations. Such annotations can, for example, be used for service discovery-the task of locating a service capable of fulfilling a business request. In this paper, we present a framework for annotating Web Services using description logics (DLs), a family of knowledge representation formalisms widely used in the Semantic Web. We show how to realise service discovery by matching semantic service descriptions, applying DL inferencing. Building on our previous work, we identify problems that occur in the matchmaking process due to the open-world assumption when handling incomplete service descriptions. We propose to use autoepistemic extensions to DLs (ADLs) to overcome these problems. ADLs allow for non-monotonic reasoning and for querying DL knowledge bases under local closed-world assumption. We investigate the use of epistemic operators of ADLs in service descriptions, and show how they affect DL inferences in the context of semantic matchmaking.

show abstract

Automated classification and retrieval of reusable software components

Yao

Etzkorn

Virani

2008

J. Am. Soc. Inf. Sci.

View full text Add to dashboard Cite

The authors describe their research which improves software reuse by using an automated approach to semantically search for and retrieve reusable software components in large software component repositories and on the World Wide Web (WWW). Using automation and smart (semantic) techniques, their approach speeds up the search and retrieval of reusable software components, while retaining good accuracy, and therefore improves the affordability of software reuse.A program understanding of software components and natural language understanding of user queries was employed. Then the software component descriptions were compared by matching the resulting semantic representations of the user queries to the semantic representations of the software components to search for software components that best match the user queries.A proof of concept system was developed to test the authors' approach. The results of this proof of concept system were compared to human experts, and statistical analysis was performed on the collected experimental data. The results from these experiments demonstrate that this automated semantic-based approach for software reusable component classification and retrieval is successful when compared to the labor-intensive results from the experts, thus showing that this approach can significantly benefit software reuse classification and retrieval.

show abstract

A software framework for matchmaking based on semantic web technology

Cited by 506 publications

References 17 publications

An Approach to Temporal-Aware Procurement of Web Services

An Approach to Temporal-Aware Procurement of Web Services

Matching Semantic Service Descriptions with Local Closed-World Reasoning

Automated classification and retrieval of reusable software components

Contact Info

Product

Resources

About