SWRL Language Research Articles

Supporting Smart Home Scenarios Using OWL and SWRL Rules.

Despite the pervasiveness of IoT domotic devices in the home automation landscape, their potential is still quite under-exploited due to the high heterogeneity and the scarce expressivity of the most commonly adopted scenario programming paradigms. The aim of this study is to show that Semantic Web technologies constitute a viable solution to tackle not only the interoperability issues, but also the overall programming complexity of modern IoT home automation scenarios. For this purpose, we developed a knowledge-based home automation system in which scenarios are the result of logical inferences over the IoT sensors data combined with formalised knowledge. In particular, we describe how the SWRL language can be employed to overcome the limitations of the well-known trigger-action paradigm. Through various experiments in three distinct scenarios, we demonstrated the feasibility of the proposed approach and its applicability in a standardised and validated context such as SAREF

Enhanced semantic representation of coaxiality with double material requirements

SummaryIn order to improve the assemblability and reduce the cost of the parts, the material requirements can be applied to the toleranced feature and the datum feature of the coaxiality at the same time in the practical application. How to realize the information exchange between different heterogeneous systems and how to read and explain the semantics of this complex tolerance specification automatically is one of the urgent problems to be solved in intelligent digital manufacturing. Ontology described in OWL2 DL and SWRL language has strict mathematical basis of description logic, and the knowledge represented by it has clear semantics and can be read and understood directly by computer. In addition, because of its consistency checking, knowledge reasoning, and flexible query ability, it becomes the most potential knowledge representation technology in the future. On the other hand, the semantic interpretation of tolerance specification by the new generation GPS theory based on skin model has the advantages of clear semantics, no ambiguity, and consistency at different stages of the product life cycle. In this article, the enhanced semantic representation ontology for this kind of coaxiality tolerance specification is constructed based on the advantages of the new GPS theory and ontology technology and the effectiveness of the method is verified and analyzed through a case.

Methods for Domain Specification of Verification-Oriented Process Ontology

User-friendly formal specifications and verification of parallel and distributed systems from various subject fields, such as automatic control, telecommunications, business processes, are active research topics due to its practical significance. In this paper, we present methods for the development of verification-oriented domain-specific process ontologies which are used to describe parallel and distributed systems of subject fields. One of the advantages of such ontologies is their formal semantics which make possible formal verification of the described systems. Our method is based on the abstract verification-oriented process ontology. We use two methods of specialization of the abstract process ontology. The declarative method uses the specialization of the classes of the original ontology, introduction of new declarative classes, as well as use of new axioms system, which restrict the classes and relations of the abstract ontology. The constructive method uses semantic markup and pattern matching techniques to link sublect fields with classes of the abstract process ontology. We provide detailed ontological specifications for these techniques. Our methods preserve the formal semantics of the original process ontology and, therefore, the possibility of applying formal verification methods to the specialized process ontologies. We show that the constructive method is a refinement of the declarative method. The construction of ontology of the typical elements of automatic control systems illustrates our methods: we develop a declarative description of the classes and restrictions for the specialized ontology in the Prot´eg´e system in the OWL language using the deriving rules written in the SWRL language and we construct the system of semantic markup templates which implements typical elements of automatic control systems.

Process Knowledge Graph Construction Method for Process Reuse

Aiming at the problems of process knowledge reuse and sharing led by the difficulty of unified representation of complex and diverse process knowledge, a process knowledge graph construction method for process reuse is proposed. Firstly, to ensure the accuracy and universality of data schema for process knowledge, the basic schema of process knowledge graph is constructed based on step-nc. Secondly, to improve process knowledge graph basic schema, the process knowledge graph extensive schema is established through process knowledge analysis and process knowledge combination. Meanwhile, to construct the process knowledge graph schema, the existing rules of experience are represented by SWRL language. Moreover, to instantiate the process knowledge graph schema, the process cases are analyzed under the guidance of process knowledge graph schema and the similarity between process cases is computed by latent semantic analysis technology. And then, process cases are transformed into the structured process knowledge graph representation, and process knowledge graph data is obtained. Finally, the process knowledge graph construction application platform is developed to verify the feasibility of the proposed method.

Verification-Oriented Process Ontology

This paper presents the ontology of the concurrent processes close to Hoare communicating sequential processes. It is a part of an intellectual system for supporting verification of behavioral properties of such processes. Our ontological representation of the processes is oriented both to the application of formal verification methods and to the extraction of information from technical documentation (by our previously developed system of information extraction from a natural language text). We describe the ontology classes and domains that define communicating concurrent processes. These processes are characterized by sets of local and shared variables, a list of actions on these variables which change their values, a list of channels for the process communication (which, in turn, are characterized by the type of reading messages, capacity, modes of writing and reading, and reliability), and also a list of communication actions for sending messages. In addition to the formal mathematical definition of classes and domains of the ontology, examples of descriptions of some ontological classes, as well as typical properties and axioms for them, are specified in the editor Protégé in the OWL language with the use of the inference rules in the SWRL language. We define the formal operational semantics of communicating processes for their ontological representation. This semantics is a labeled transition system. It is reduced to the local operational semantics of separate process instances in the interleaving model. We specialize several types of processes from the subject domain of automatic control systems that model the typical functional elements of the automatic control system (sensors, comparators and regulators), as well as their combinations. The concepts of the specialized ontology are illustrated by the example of a control part of a bottle-filling system.

Verification Oriented Process Ontology

This paper presents the ontology of the concurrent processes close to Hoare communicating sequential processes. It is the part of the intellectual system for supporting verification of behavioural properties of these processes. Our ontological representation of the processes is oriented both to the application of formal verification methods and to the extraction of information from technical documentation (by our previously developed system of information extraction from a natural language text). We describe the ontology classes and domains that define communicating concurrent processes. These processes are characterized by sets of local and shared variables, a list of actions on these variables which change their values, a list of channels for the process communication (which, in turn, are characterized by the type of reading messages, capacity, ways of writing and reading, and reliability), and also a list of communication actions for sending messages. In addition to the formal mathematical definition of classes and domains of the ontology, examples of descriptions of some ontological classes as well as typical properties and axioms for them are specified in the editor Prot ́eg ́e in the OWL language with the use of the inference rules in the SWRL language. The formal operational semantics of communicating processes is determined on their ontological representation and is given as a labelled transition system. It is reduced to the local operational semantics of separate process instances in the interleaving model. We specialize several types of processes from the subject domain of automatic control systems that model the typical functional elements of the automatic control system (sensors, comparators and regulators) as well as their combinations. The concepts of the specialized ontology are illustrated by the example of a control part for a bottle-filling system.

An ontology-based semantic retrieval approach for heterogeneous 3D CAD models

Many types of heterogeneous CAD models created by previous product development activities are stored in enterprise databases. Searching reusable CAD models for engineer design requirements is still very difficult. In this paper, we propose an ontology-based semantic retrieval approach for heterogeneous 3D CAD models by using semantic web theory and information retrieval theory. By exploiting layered feature ontology and ontology mapping, a uniform description for heterogeneous CAD models is generated as semantic descriptor. Meanwhile, to improve the representative ability, several heuristic rules are constructed with the aid of SWRL language and ontology reasoning is acted on the semantic descriptors, which makes our retrieval system achieve better performance. Furthermore, multi-mode similarity measurement is carried out to meet engineers’ diversified requirements. We demonstrate the feasibility and effectiveness of our approach through experiments on heterogeneous 3D CAD model library.

A set of ontology design patterns for reengineering SBVR statements into OWL/SWRL ontologies

The work presents a set of ontology design patterns.Patterns provide a way to obtain an OWL/SWRL ontology from a SBVR specification.Translations from SBVR to SWRL fill the gap in the expressive power of SBVR and OWL.Patterns are readily usable for business people or software developers.Patterns are illustrated by means of an example depicting a fictitious company. The interest in the use of ontologies for creating more intelligent and effective enterprise information systems has increased considerably in recent years. The most critical aspects during the development of these systems are: (1) to identify the ontology concepts and (2) to make explicit the business rules by means of the ontology axioms.In order to address these issues, mappings of business rules expressions to ontology statements based on different languages were proposed. Despite the efforts made in this area, some work remain to be done.This work presents a set of ontology design patterns providing a way to obtain an OWL/SWRL ontology by applying metamodel transformation rules over the SBVR specification of a business domain. Patterns are rooted in the structural specification of the standards, providing a set of mappings readily usable for business people or developers concerned with the implementation of a mapping tool. Moreover, translations from SBVR to SWRL language are presented in order to fill the gap in the expressive power of SBVR and OWL. The theoretical expressions of patterns are illustrated by means of an example depicting the core structure of a fictitious company.