YUTING ZHAO

Autonomous Ontology: Operations and Semantics OR Local Semantics with Semantic Binding on Foreign Entity

Lecture Notes in Computer Science, 2006

In this paper, firstly we put forward an AO framework of autonomous ontology, by which a language... more In this paper, firstly we put forward an AO framework of autonomous ontology, by which a language entity in an ontology is interpreted locally, nevertheless the semantic cooperation is still keeping. Different from various of works based on DDL (Distribute Description Logic [1]), AO framework depends on semantic binding instead of domain-relation to set up relationship between different ontologies so

Ontology Learning from Incomplete Semantic Web Data by BelNet

2013 IEEE 25th International Conference on Tools with Artificial Intelligence, 2013

ABSTRACT Recent years have seen a dramatic growth of semantic web on the data level, but unfortun... more ABSTRACT Recent years have seen a dramatic growth of semantic web on the data level, but unfortunately not on the schema level, which contains mostly concept hierarchies. Theshortage of schemas makes the semantic web data difficult to be used in many semantic web applications, so schemas learningfrom semantic web data becomes an increasingly pressing issue. In this paper we propose a novel schemas learning approach -BelNet, which combines description logics (DLs) with Bayesian networks. In this way BelNet is capable to understand andcapture the semantics of the data on the one hand, and tohandle incompleteness during the learning procedure on theother hand. The main contributions of this work are: (i)we introduce the architecture of BelNet, and correspondinglypropose the ontology learning techniques in it, (ii) we compare the experimental results of our approach with the state-of-the-art ontology learning approaches, and provide discussions from different aspects.

Belief Base Revision for Datalog+/- Ontologies

Lecture Notes in Computer Science, 2014

Implementing and Evaluating a Rule-Based Approach to Querying Regular EL+ Ontologies

2009 Ninth International Conference on Hybrid Intelligent Systems, 2009

Abstract Recent years have witnessed the wide recognition of the importance of ontology and rule ... more Abstract Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-based approach to querying regular EL+, a restriction of a well known description logics based ontology language EL+, by only allowing regular role axioms. It is known that, without such a restriction, query answering in EL+ in general is undividable. In our approach, a regular EL+ ontology is first translated into a logic program which contains a set of rules, ...

Towards Soundness Preserving Approximation for ABox Reasoning of OWL2

Description Logics, 2010

There were 48 papers submitted each of which was reviewed by at least three members of the progra... more

Download

Task Representation and Retrieval in an Ontology-Guided Modelling System

International Semantic Web Conference, 2008

A modelling procedure consists of a sequence of modelling tasks. With the increasing size of mode... more A modelling procedure consists of a sequence of modelling tasks. With the increasing size of models during the development, the relations among modelling objects and their corresponding tasks become more and more complex. Therefore, the automatic identification of available tasks for current modelling environments can significantly improve the efficiency of modelling. In this paper, we present a novel approach which integrates task pre-and post-conditions into ontologies that describe the models, and infers availability of tasks through ontology reasoning and query answering. We illustrate this approach with an application on process modelling and show how this can be generalised to other domains.

Download

EASTWEB: building an integrated leading Euro-Asian higher education and research community in the field of the SemanTic WEB

Based on the experience of the EC funded project EASTWEB, a project involving Universities from I... more Based on the experience of the EC funded project EASTWEB, a project involving Universities from Italy (main partner), and Thailand, we describe a set of on going and planned collaboration activities. We highlight what we see the major advantages but also the difficulties in carrying out such a program.

Download

Implementing and Evaluating a Rule-Based Approach to Querying Regular EL+ Ontologies

Hybrid Intelligent Systems, 2009

Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI... more Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-based approach to querying regular EL+, a restriction of a well known description logics based ontology language EL+, by only allowing regular role axioms. It is known that, without such a restriction, query answering in EL+ in general is undividable. In our approach, a regular EL+ ontology is first translated into a logic program which contains a set of rules, and then by forward chaining reasoning the pseudo model of the above logic program is calculated. Query answering for EL+ is rewritten to instance checking in the pseudo model of a logic program. To the best of our knowledge, this is the first report of implementation and evaluation for regular EL+ ontologism.

Soundness Preserving Approximation for TBox Reasoning

National Conference on Artificial Intelligence, 2010

TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N... more TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2ET-complete; even with R, a fragment of SROIQ supporting ALC GCIs and role chains, the complexity of reasoning is 2ET-hard. Although various optimisation techniques have been applied, existing tableau-based DL reasoners are still inefficient in dealing with arbitrary GCIs especially when complex role chains present. In this paper, we present a soundness preserving approximation for TBox reasoning in R. The main idea is to convert R ontologies to EL + with an additional complement table maintaining the complementary relations between named concepts. Since existing benchmarks do not focus on complex GCIs and RIs, we propose a new set of testing ontologies for TBox reasoning in R and our preliminary evaluation shows that a naive implementation of our complement-integrated TBox reasoning algorithm outperforms existing reasoners on most of these ontologies.

Download

Soundness Preserving Approximation for TBox Reasoning in R

Description Logics, 2009

TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N... more TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2ET-complete; even with R, a fragment of SROIQ supporting ALC GCIs and role chains, the complexity of reasoning is 2ET-hard. Although various optimisation techniques have been applied, existing tableau-based DL reasoners are still inefficient in dealing with arbitrary GCIs especially when complex role chains present. In this paper, we present a soundness preserving approximation for TBox reasoning in R. The main idea is to convert R ontologies to EL + with an additional complement table maintaining the complementary relations between named concepts. Since existing benchmarks do not focus on complex GCIs and RIs, we propose a new set of testing ontologies for TBox reasoning in R and our preliminary evaluation shows that a naive implementation of our complement-integrated TBox reasoning algorithm outperforms existing reasoners on most of these ontologies.

Download

Semantic Cooperation and Knowledge Reuse by Using Autonomous Ontologies

International Semantic Web Conference, 2007

Several proposals have been put forward to support distributed agent cooperation in the Semantic ... more Several proposals have been put forward to support distributed agent cooperation in the Semantic Web, by allowing concepts and roles in one ontology be reused in another ontology. In general, these proposals reduce the autonomy of each ontology by defining the semantics of the ontology to depend on the semantics of the other ontologies. We propose a new framework for managing autonomy in a set of cooperating ontologies (or ontology space). In this framework, each language entity (concept/role/individual) in an ontology may have its meaning assigned either locally with respect to the semantics of its own ontology, to preserve the autonomy of the ontology, or globally with respect to the semantics of any neighbouring ontology in which it is defined, thus enabling semantic cooperation between multiple ontologies. In this way, each ontology has a “subjective semantics” based on local interpretation and a “foreign semantics” based on semantic binding to neighbouring ontologies. We study the properties of these two semantics and describe the conditions under which entailment and satisfiability are preserved. We also introduce two reasoning mechanisms under this framework: “cautious reasoning” and “brave reasoning”. Cautious reasoning is done with respect to a local ontology and its neighbours (those ontologies in which its entities are defined); brave reasoning is done with respect to the transitive closure of this relationship. This framework is independent of ontology languages. As a case study, for Description Logic \(\mathcal{ALCN}\) we present two tableau-based algorithms for performing each form of reasonings and prove their correctness.

Download

Semantic Import: An Approach for Partial Ontology Reuse

International Semantic Web Conference, 2006

As more and more applications use ontology to represent semantic information, how to support onto... more As more and more applications use ontology to represent semantic information, how to support ontology reuse is becoming more and more important. In the OWL Web Ontology Language, the main primitive for ontology reuse is owl:imports. However, this "copy-andpaste" approach suffers a number of problems. In this paper, we propose a new import primitive, called semantic import, to facilitate partial ontology reuse. The main contributions of this paper include the semantics of semantic import and reasoning support for TBox reasoning in simple ontology spaces, where an ontology semantically imports vocabulary from another ontology. The semantic import approach provides a brand new way for partial ontology reuse.

Download

Completeness Guaranteed Approximations for OWL-DL Query Answering

Description Logics, 2009

How to provide scalable and quality guaranteed approximation for query answering over expressive ... more How to provide scalable and quality guaranteed approximation for query answering over expressive description logics (DLs) is an important problem in knowledge representation (KR). This is a pressing issue, in particular due to the fact that, for the widely used standard Web Ontology Language OWL, whether conjunctive query answering is decidable is still an open problem. Pan and Thomas propose a soundness guaranteed approximation, which transforms an ontology in a more expressive DL to its least upper bound approximation in a tractable DL. In this paper, we investigate a completeness guaranteed approximation, based on transformations of both the source ontology and input queries. We have implemented both soundness guaranteed and completeness guaranteed approximations in our TrOWL ontology reasoning infrastructure.

Download

Validating Process Refinement with Ontologies

Description Logics, 2009

A crucial task in process management is the validation of process refinements. A process refineme... more A crucial task in process management is the validation of process refinements. A process refinement is a process description in a more fine-grained representation. The refinement is either with respect to an abstract model or with respect to component's principle behaviour model. We define process refinement based on the execution set semantics. Predecessor and successor relations of the activities are described in an ontology in which the refinement is represented and validated by concept satisfiability checking.

Download

Guidance in Business Process Modelling

This chapter shows how process modellers can be supported by guidance. If a telecommunication pro... more This chapter shows how process modellers can be supported by guidance. If a telecommunication provider introduces a value-added service, this might involve the establishment of new business processes, whose specification is not trivial. A guidance engine can help a process engineer develop a new business process by stepwise refining, i.e. creating a more concrete version of the process from an abstract version. The guidance engine identifies inconsistencies and proposes possible refinement steps. The topics covered in this chapter range from theoretical foundations of business process refinement over the formalisation of refinement problems in ontologies to implementation issues. The presented solutions were developed in the MOST project.

Conclusion and Outlooks

Ontology-Driven Software Development, 2012

Ontology Languages and Description Logics

Ontology-Driven Software Development, 2012

Scalable Ontology Reasoning Services

Ontology-Driven Software Development, 2012

Autonomous Ontology: Operations and Semantics

Asian Semantic Web Conference, 2006

In this paper, firstly we put forward an AO framework of autonomous ontology, by which a language... more In this paper, firstly we put forward an AO framework of autonomous ontology, by which a language entity in an ontology is interpreted locally, nevertheless the semantic cooperation is still keeping. Different from various of works based on DDL (Distribute Description Logic [1]), AO framework depends on semantic binding instead of domain-relation to set up relationship between different ontologies so that it avoids damaging the autonomy of each local ontology. Secondly we formalize the basic operations among ontologies, say free-access operation, importing operation, and mapping operation in the AO framework, and give out the proper semantics of them.

Building Heterogeneous Multi-context Systems by Semantic Bindings

We propose a framework for heterogeneous multi-context systems, in which a special kind of semant... more We propose a framework for heterogeneous multi-context systems, in which a special kind of semantic/implicit bridge rules are introduced. Traditional bridge rules in heterogeneous multi-context systems may make the syntax and the semantics of a context more complex, e.g., in the approach of [3] an agent may have to facing a context composed by a description logic systems and a logic program with default negations. In this paper we hide the bridge rules by semantic binding on foreign knowledge fragment, and track the semantic property of a belief/knowledge in one context by a mirror-image of it in the other context. This framework can manage heterogeneous multi-contexts in a simple way, and it keeps the original reasoning properties of the context so that the original reasoning tools are still useful.

Download

Uploads

Papers by YUTING ZHAO

Log In