scholarly journals Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach

2007 ◽  
Vol 29 ◽  
pp. 269-307 ◽  
Author(s):  
T. Di Noia ◽  
E. Di Sciascio ◽  
F. M. Donini
Keyword(s):  
Semantic Web ◽  
Knowledge Representation ◽  
Web Service ◽  
Description Logic ◽  
Supply And Demand ◽  
Description Logics ◽  
Semantic Web Services ◽  
Logical Framework ◽  
Electronic Marketplace ◽  
Logic Approach

Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job profiles. In such open environments, the objective of a matchmaking process is to discover best available offers to a given request. We address the problem of matchmaking from a knowledge representation perspective, with a formalization based on Description Logics. We devise Concept Abduction and Concept Contraction as non-monotonic inferences in Description Logics suitable for modeling matchmaking in a logical framework, and prove some related complexity results. We also present reasonable algorithms for semantic matchmaking based on the devised inferences, and prove that they obey to some commonsense properties. Finally, we report on the implementation of the proposed matchmaking framework, which has been used both as a mediator in e-marketplaces and for semantic web services discovery.

scholarly journals Configuration knowledge representations for Semantic Web applications

2003 ◽  
Vol 17 (1) ◽  
pp. 31-50 ◽  
Author(s):  
ALEXANDER FELFERNIG ◽  
GERHARD FRIEDRICH ◽  
DIETMAR JANNACH ◽  
MARKUS STUMPTNER ◽  
MARKUS ZANKER
Keyword(s):  
Problem Solving ◽  
Semantic Web ◽  
Knowledge Representation ◽  
Web Applications ◽  
Description Logic ◽  
Predicate Logic ◽  
Description Logics ◽  
Formal Semantics ◽  
Problem Definition ◽  
Configuration Problem

Today's economy exhibits a growing trend toward highly specialized solution providers cooperatively offering configurable products and services to their customers. This paradigm shift requires the extension of current standalone configuration technology with capabilities of knowledge sharing and distributed problem solving. In this context a standardized configuration knowledge representation language with formal semantics is needed in order to support knowledge interchange between different configuration environments. Languages such as Ontology Inference Layer (OIL) and DARPA Agent Markup Language (DAML+OIL) are based on such formal semantics (description logic) and are very popular for knowledge representation in the Semantic Web. In this paper we analyze the applicability of those languages with respect to configuration knowledge representation and discuss additional demands on expressivity. For joint configuration problem solving it is necessary to agree on a common problem definition. Therefore, we give a description logic based definition of a configuration problem and show its equivalence with existing consistency-based definitions, thus joining the two major streams in knowledge-based configuration (description logics and predicate logic/constraint based configuration).

scholarly journals Hypertableau Reasoning for Description Logics

2009 ◽  
Vol 36 ◽  
pp. 165-228 ◽  
Author(s):  
B. Motik ◽  
R. Shearer ◽  
I. Horrocks
Keyword(s):  
Semantic Web ◽  
Knowledge Representation ◽  
Description Logic ◽  
State Of The Art ◽  
Description Logics ◽  
Primary Sources ◽  
Performance Improvements ◽  
Introduction Rule ◽  
Significant Performance ◽  
Representation Formalism

We present a novel reasoning calculus for the description logic SHOIQ^+---a knowledge representation formalism with applications in areas such as the Semantic Web. Unnecessary nondeterminism and the construction of large models are two primary sources of inefficiency in the tableau-based reasoning calculi used in state-of-the-art reasoners. In order to reduce nondeterminism, we base our calculus on hypertableau and hyperresolution calculi, which we extend with a blocking condition to ensure termination. In order to reduce the size of the constructed models, we introduce anywhere pairwise blocking. We also present an improved nominal introduction rule that ensures termination in the presence of nominals, inverse roles, and number restrictions---a combination of DL constructs that has proven notoriously difficult to handle. Our implementation shows significant performance improvements over state-of-the-art reasoners on several well-known ontologies.

PROCESS MODEL ONTOLOGY-BASED MATCHMAKING OF SEMANTIC WEB SERVICES

2011 ◽  
Vol 20 (04) ◽  
pp. 357-370 ◽  
Author(s):  
D. PAULRAJ ◽  
S. SWAMYNATHAN ◽  
M. MADHAIYAN
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Web Service ◽  
Process Model ◽  
Service Discovery ◽  
Service Oriented Architecture ◽  
Semantic Web Services ◽  
Functional Part ◽  
Service Oriented ◽  
Concise Description

One of the key challenges of the Service Oriented Architecture is the discovery of relevant services for a given task. In Semantic Web Services, service discovery is generally achieved by using the service profile ontology of OWL-S. Profile of a service is a derived, concise description and not a functional part of the semantic web service. There is no schema present in the service profile to describe the input, output (IO), and the IOs in the service profile are not always annotated with ontology concepts, whereas the process model has such a schema to describe the IOs which are always annotated with ontology concepts. In this paper, we propose a complementary sophisticated matchmaking approach which uses the concrete process model ontology of OWL-S instead of the concise service profile ontology. Empirical analysis shows that high precision and recall can be achieved by using the process model-based service discovery.

A QoS-aware approach for runtime discovery, selection and composition of semantic web services

2016 ◽  
Vol 12 (2) ◽  
pp. 177-200 ◽  
Author(s):  
Sanjay Garg ◽  
Kirit Modi ◽  
Sanjay Chaudhary
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Web Service ◽  
User Satisfaction ◽  
Service Discovery ◽  
Semantic Web Services ◽  
Functional Requirements ◽  
Semantic Description ◽  
Content Type ◽  
The Web

Purpose Web services play vital role in the development of emerging technologies such as Cloud computing and Internet of Things. Although, there is a close relationship among the discovery, selection and composition tasks of Web services, research community has treated these challenges at individual level rather to focus on them collectively for developing efficient solution, which is the purpose of this work. This paper aims to propose an approach to integrate the service discovery, selection and composition of Semantic Web services on runtime basis. Design/methodology/approach The proposed approach defined as a quality of service (QoS)-aware approach is based on QoS model to perform discovery, selection and composition tasks at runtime to enhance the user satisfaction and quality guarantee by incorporating non-functional parameters such as response time and throughput with the Web services and user request. In this paper, the proposed approach is based on ontology for semantic description of Web services, which provides interoperability and automation in the Web services tasks. Findings This work proposed an integrated framework of Web service discovery, selection and composition which supports end user to search, select and compose the Web services at runtime using semantic description and non-functional requirements. The proposed approach is evaluated by various data sets from the Web Service Challenge 2009 (WSC-2009) to show the efficiency of this work. A use case scenario of Healthcare Information System is implemented using proposed work to demonstrate the usability and requirement the proposed approach. Originality/value The main contribution of this paper is to develop an integrated approach of Semantic Web services discovery, selection and composition by using the non-functional requirements.

scholarly journals Unifying Class-Based Representation Formalisms

1999 ◽  
Vol 11 ◽  
pp. 199-240 ◽  
Author(s):  
D. Calvanese ◽  
M. Lenzerini ◽  
D. Nardi
Keyword(s):  
Knowledge Representation ◽  
Description Logic ◽  
Description Logics ◽  
Expressive Power ◽  
Finite Model ◽  
Functional Dependencies ◽  
Semantic Data ◽  
Representation Systems ◽  
Frame Systems ◽  
Essential Set

The notion of class is ubiquitous in computer science and is central in many formalisms for the representation of structured knowledge used both in knowledge representation and in databases. In this paper we study the basic issues underlying such representation formalisms and single out both their common characteristics and their distinguishing features. Such investigation leads us to propose a unifying framework in which we are able to capture the fundamental aspects of several representation languages used in different contexts. The proposed formalism is expressed in the style of description logics, which have been introduced in knowledge representation as a means to provide a semantically well-founded basis for the structural aspects of knowledge representation systems. The description logic considered in this paper is a subset of first order logic with nice computational characteristics. It is quite expressive and features a novel combination of constructs that has not been studied before. The distinguishing constructs are number restrictions, which generalize existence and functional dependencies, inverse roles, which allow one to refer to the inverse of a relationship, and possibly cyclic assertions, which are necessary for capturing real world domains. We are able to show that it is precisely such combination of constructs that makes our logic powerful enough to model the essential set of features for defining class structures that are common to frame systems, object-oriented database languages, and semantic data models. As a consequence of the established correspondences, several significant extensions of each of the above formalisms become available. The high expressiveness of the logic we propose and the need for capturing the reasoning in different contexts forces us to distinguish between unrestricted and finite model reasoning. A notable feature of our proposal is that reasoning in both cases is decidable. We argue that, by virtue of the high expressive power and of the associated reasoning capabilities on both unrestricted and finite models, our logic provides a common core for class-based representation formalisms.

Sign in / Sign up

Export Citation Format

Share Document