Inheritance and Rules in Object-Oriented Semantic Web Languages

Inheritance and Rules in Object-Oriented Semantic Web Languages (0)

by G Yang, M Kifer

Venue:

In 2nd International Workshop on Rules and Rule Markup Languages for the Semantic Web (RULEML’03

Results 1 - 10 of 10

Web Service Modeling Ontology

by Dumitru Roman, Uwe Keller, Holger Lausen, Jos De Bruijn, Rubén Lara, Michael Stollberg, Axel Polleres, Cristina Feier, Cristoph Bussler, Dieter Fensel - STANDARD (WSMO - STANDARD), WSMO DELIVERABLE D2 VERSION 1.0 WORKING DRAFT 29 JULY 2004. AVAILABLE: HTTP://WWW.WSMO.ORG/2004/D2/V1.0/20040729

"... The potential to achieve dynamic, scalable and cost-effective marketplaces and eCommerce solutions has driven recent research efforts towards so-called Semantic Web Services, that are enriching Web services with machine-processable semantics. To this end, the Web Service Modeling Ontology (WSMO) pro ..."

Abstract - Cited by 270 (23 self) - Add to MetaCart

The potential to achieve dynamic, scalable and cost-effective marketplaces and eCommerce solutions has driven recent research efforts towards so-called Semantic Web Services, that are enriching Web services with machine-processable semantics. To this end, the Web Service Modeling Ontology (WSMO) provides the conceptual underpinning and a formal language for semantically describing all relevant aspects of Web services in order to facilitate the automatization of discovering, combining and invoking electronic services over the Web. In this paper we describe the overall structure of WSMO by its four main elements: ontologies, which provide the terminology used by other WSMO elements, Web services, which provide access to services that, in turn, provide some value in some domain, goals that represent user desires, and mediators, which deal with interoperability problems between different WSMO elements. Along with introducing the main elements of WSMO, we provide a logical language for defining formal statements in WSMO together with some motivating examples from practical use cases which shall demonstrate the benefits of Semantic Web Services.

FLORA-2: A Rule-Based Knowledge Representation and Inference Infrastructure for the Semantic Web

by Guizhen Yang, Michael Kifer, Chang Zhao - In Second International Conference on Ontologies, Databases and Applications of Semantics (ODBASE , 2003

"... Abstract. Flora-2 is a rule-based object-oriented knowledge base system designed for a variety of automated tasks on the Semantic Web, ranging from meta-data management to information integration to intelligent agents. The Flora-2 system integrates F-logic, HiLog, and Transaction Logic into a cohere ..."

Abstract - Cited by 66 (5 self) - Add to MetaCart

Abstract. Flora-2 is a rule-based object-oriented knowledge base system designed for a variety of automated tasks on the Semantic Web, ranging from meta-data management to information integration to intelligent agents. The Flora-2 system integrates F-logic, HiLog, and Transaction Logic into a coherent knowledge representation and inference language. The result is a flexible and natural framework that combines rule-based and object-oriented paradigms. This paper discusses the principles underlying the design of the Flora-2 system and describes its salient features, including meta-programming, reification, logical database updates, encapsulation, and support for dynamic modules. 1

(Show Context)

A Logical Framework for Web Service Discovery

by Michael Kifer, Rubén Lara, Axel Polleres, Chang Zhao, Uwe Keller, Holger Lausen, Dieter Fensel - In Proc. of the ISWC 2004 workshop on Semantic Web Services: Preparing to Meet the World of Business Applications , 2004

"... Abstract. Current technologies for Web Services are based on syntactical descriptions and, therefore, lend themselves to only limited amount of automation. Research efforts in Semantic Web Services, such as WSMO, try to overcome this major deficiency by providing a complete semantic description for ..."

Abstract - Cited by 38 (11 self) - Add to MetaCart

Abstract. Current technologies for Web Services are based on syntactical descriptions and, therefore, lend themselves to only limited amount of automation. Research efforts in Semantic Web Services, such as WSMO, try to overcome this major deficiency by providing a complete semantic description for Web Services and their related aspects. In this paper we present a logical framework which exploits such formal descriptions in order to dynamically discover Web Services that match requester goals. We consider two kinds of user goals: discovery and contracting. Based on the WSMO conceptual model, we define proof obligations that formalize the concepts of a match in these two cases. We also describe a concrete realization of this framework in the F-Logic reasoning engine F LORA-2. Such a realization requires an extension of F-Logic in order to support rule reification. With this extension, F-logic becomes a suitable framework for describing and reasoning about Semantic Web Services and their capabilities. 1

(Show Context)

Reasoning about Anonymous Resources and Meta Statements on the Semantic Web

by Guizhen Yang, Michael Kifer - Data Semantics I, volume 2800 of Lecture Notes in Computer Science , 2003

"... Abstract. Anonymous resources and meta statements are two of the more interesting features of RDF — an emerging standard for representing semantic information on the Web. Ironically, when RDF was standardized by W3C over three years ago [24], it came without a semantics. There is now growing underst ..."

Abstract - Cited by 33 (6 self) - Add to MetaCart

Abstract. Anonymous resources and meta statements are two of the more interesting features of RDF — an emerging standard for representing semantic information on the Web. Ironically, when RDF was standardized by W3C over three years ago [24], it came without a semantics. There is now growing understanding that a Semantic Web language without a semantics is an oxymoron, and a number of efforts are directed towards giving RDF a precise semantics [17,15,11]. In this paper we propose a simple semantics for anonymous resources and meta statements in F-logic [23] — a frame-based logic language, which is a popular formalism for representing and reasoning about semantic information on the Web [29,14,16,13,12]. The choice of F-logic (over RDF) as a basis for our semantics is motivated by the fact that F-logic provides a comprehensive solution for the problem of integrating frames, rules, inheritance, and deduction, and it has been shown to provide an effective inference service for RDF [13,28]. 1

(Show Context)

Extended RDF as a Semantic Foundation of Rule Markup Languages

by Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio, Gerd Wagner - Journal of Artificial Intelligence Research

"... Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts, based on base concepts. For example, rules allow to define the extension of a class or property, based on a complex relation between ..."

Abstract - Cited by 13 (8 self) - Add to MetaCart

Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts, based on base concepts. For example, rules allow to define the extension of a class or property, based on a complex relation between the extensions of the same or other classes and properties. On the other hand, the inclusion of negative information both in the form of negation-asfailure and explicit negative information is also needed to enable various forms of reasoning. In this paper, we extend RDF graphs with weak and strong negation, as well as derivation rules. The ERDF stable model semantics of the extended framework (Extended RDF) is defined, extending RDF(S) semantics. A distinctive feature of our theory, which is based on Partial Logic, is that both truth and falsity extensions of properties and classes are considered, allowing for truth value gaps. Our framework supports both closed-world and open-world reasoning through the explicit representation of the particular closed-world assumptions and the ERDF ontological categories of total properties and total classes. 1.

Nonmonotonic Reasoning in FLORA-2

by Michael Kifer - Logic Programming and Nonmonotonic Reasoning , 2005

"... Abstract. FLORA-2 is an advanced knowledge representation system that integrates F-logic, HiLog, and Transaction Logic. In this paper we give an overview of the theoretical foundations of the system and of some of the aspects of nonmonotonic reasoning in FLORA-2. These include scoped default negatio ..."

Abstract - Cited by 10 (1 self) - Add to MetaCart

Abstract. FLORA-2 is an advanced knowledge representation system that integrates F-logic, HiLog, and Transaction Logic. In this paper we give an overview of the theoretical foundations of the system and of some of the aspects of nonmonotonic reasoning in FLORA-2. These include scoped default negation, behavioral inheritance, and nonmonotonicity that stems from database dynamics. 1

(Show Context)

Stable Model Theory for Extended RDF

by Ontologies Anastasia Analyti, Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio, Gerd Wagner

"... Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts based on base concepts. For example, rules allow to define the extension of a class or property based on a complex relation betwee ..."

Abstract - Add to MetaCart

Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts based on base concepts. For example, rules allow to define the extension of a class or property based on a complex relation between the extensions of the same or other classes and properties. On the other hand, the inclusion of negative information both in the form of negation-as-failure and explicit negative information is also needed to enable various forms of reasoning. In this paper, we extend RDF graphs with weak and strong negation, as well as derivation rules. The ERDF stable model semantics of the extended framework (Extended RDF) is defined, extending RDF(S) semantics. A distinctive feature of our theory, which is based on partial logic, is that both truth and falsity extensions of properties and classes are considered, allowing for truth value gaps. Our framework supports both closed-world and open-world reasoning through the explicit representation of the particular closed-world assumptions and the ERDF ontological categories of total properties and total classes.