Search

In the current era of increased customization, changing manufacturing systems and business globalization, effective use of product design information and knowledge generated from the product model can facilitate the decision-making of an assembly sequence by providing feasible product relationships and a viable semantic foundation. To enrich such semantics, a geometryenhanced ontology modelling and reasoning framework is proposed in this paper to explicitly express relevant concepts for assembly sequence planning (ASP). A rule-based reasoning mechanism based on Ontology Web Language Description Logics (OWL-DL) and Semantic Web Rule Language (SWRL) is also suggested to clarify implicit relations by incorporating reasoning units (RUs) to process complex geometric information. This framework is then validated with a complex case study related to assembly sequence planning. [ABSTRACT FROM AUTHOR]

Managing risk in business processes has been a subject of active research in the past few years. The current uncertain global business environment especially requires organizations to adopt more effective risk management approaches that properly cope with both negative and positive impacts from risk in business process execution. This study introduces a process-related risk management approach that can support comprehensive and proactive risk management during the runtime stage of business processes. First, it analyzes the behavioral requirements for proactive management of process-related risk. Second, it suggests a framework that enables timely risk monitoring and treatment. Third, it offers a rule language as an implementation model for systematic support of the proposed risk management approach. Finally, it presents an architecture and prototype system to demonstrate the feasibility of the proposed framework and rule language. This approach overcomes the limitations of existing risk management approaches by identifying all necessary activities, as well as when and where they must be applied. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Background: With recent advances in computerized patient records system, there is an urgent need for producing computable and standards-based clinical diagnostic criteria. Notably, constructing rule-based clinical diagnosis criteria has become one of the goals in the International Classification of Diseases (ICD)-11 revision. However, few studies have been done in building a unified architecture to support the need for diagnostic criteria computerization. In this study, we present a modular architecture for enabling the creation of rule-based clinical diagnostic criteria leveraging Semantic Web technologies. Methods and results: The architecture consists of two modules: an authoring module that utilizes a standards-based information model and a translation module that leverages Semantic Web Rule Language (SWRL). In a prototype implementation, we created a diagnostic criteria upper ontology (DCUO) that integrates ICD-11 content model with the Quality Data Model (QDM). Using the DCUO, we developed a transformation tool that converts QDM-based diagnostic criteria into Semantic Web Rule Language (SWRL) representation. We evaluated the domain coverage of the upper ontology model using randomly selected diagnostic criteria from broad domains (n = 20). We also tested the transformation algorithms using 6 QDM templates for ontology population and 15 QDM-based criteria data for rule generation. As the results, the first draft of DCUO contains 14 root classes, 21 subclasses, 6 object properties and 1 data property. Investigation Findings, and Signs and Symptoms are the two most commonly used element types. All 6 HQMF templates are successfully parsed and populated into their corresponding domain specific ontologies and 14 rules (93.3 %) passed the rule validation. Conclusion: Our efforts in developing and prototyping a modular architecture provide useful insight into how to build a scalable solution to support diagnostic criteria representation and computerization. [ABSTRACT FROM AUTHOR]

We study the problem of rewriting a Disjunctive Datalog program into an equivalent plain Datalog program (i.e., one that entails the same facts for every dataset). We show that a Disjunctive Datalog program is Datalog rewritable if and only if it can be rewritten into a linear program (i.e., having at most one IDB body atom in each rule), thus providing a novel characterisation of Datalog rewritability in terms of linearisability. Motivated by this result, we propose the class of markable programs, which extends both Datalog and linear Disjunctive Datalog and admits Datalog rewritings of polynomial size. We show that our results can be seamlessly applied to ontological reasoning and identify two classes of non-Horn ontologies that admit Datalog rewritings of polynomial and exponential size, respectively. Finally, we shift our attention to conjunctive query answering and extend our results to the problem of computing a rewriting of a Disjunctive Datalog program that yields the same answers to a given query w.r.t. arbitrary data. Our empirical results suggest that a fair number of non-Horn ontologies are Datalog rewritable and that query answering over such ontologies becomes feasible using a Datalog engine. [ABSTRACT FROM AUTHOR]

We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn ‐ R eg I , Horn ‐ S H I Q and Horn ‐ S R O I Q , while still has PTime data complexity. In comparison with Horn ‐ S R O I Q , Horn-DL additionally allows the universal role and assertions of the form i r r e fl e x i v e s , ¬ s ( a , b ), a ≠ ˙ b . More importantly, in contrast to all the well-known Horn fragments E L , DL-Lite, DLP, Horn ‐ S H I Q , and Horn ‐ S R O I Q of description logics, Horn-DL allows a form of the concept constructor “universal restriction” to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. We develop the first algorithm with PTime data complexity for checking satisfiability of Horn-DL knowledge bases. [ABSTRACT FROM AUTHOR]

Abstract: In most cases, designers have to manually specify both assembly tolerance types and values when they design a mechanical product. Different designers will possibly specify different assembly tolerance types and values for the same nominal geometry. Furthermore, assembly tolerance specification design of a complex product is a highly collaborative process, in which semantic interoperability issues significantly arise. These situations will cause the uncertainty in assembly tolerance specification design and finally affect the quality of the product. In order to reduce the uncertainty and to support the semantic interoperability in assembly tolerance specification design, an ontology-based approach for automatically generating assembly tolerance types is proposed. First of all, an extended assembly tolerance representation model is constructed by introducing a spatial relation layer. The constructed model is hierarchically organized and consists of part layer, assembly feature surface layer, and spatial relation layer. All these layers are defined with Web Ontology Language (OWL) assertions. Next, a meta-ontology for assembly tolerance representations is constructed. With this meta-ontology, the domain-specific assembly tolerance representation knowledge can be derived by reusing or inheriting the classes or properties. Based on this, assembly tolerance representation knowledge is formalized using OWL. As a result, assembly tolerance representation knowledge has well-defined semantics due to the logic-based semantics of OWL, making it possible to automatically detect inconsistencies of assembly tolerance representation knowledge bases. The mapping relations between spatial relations and assembly tolerance types are represented in Semantic Web Rule Language (SWRL). Furthermore, actual generation processes of assembly tolerance types are carried out using Java Expert System Shell (JESS) by mapping OWL-based structure knowledge and SWRL-based constraint knowledge into JESS facts and JESS rules, respectively. Based on this, an approach for automatically generating assembly tolerance types is proposed. Finally, the effectiveness of the proposed approach is demonstrated by a practical example. [Copyright &y& Elsevier]

In this paper, we introduce a media decision taking engine (MDTE), enabling the automatic selection and/or rating of multimedia content versions, based on the available context information. The presented approach is fully semantic-driven, which means that we not only semantically model the context information, but also the decision algorithms themselve, which are represented in N3 Rules, a rule language that extends RDF. The decision rules are based on a rating function, supporting the specification of weights and affinity parameters for each environment property. Finally, we show how the MDTE is integrated in a media delivery platform, using the provisions of the existing Web infrastructure. [ABSTRACT FROM AUTHOR]

Abstract: Although the OWL (Web Ontology Language) and SWRL (Semantic Web Rule Language) add considerable expressiveness to the Semantic Web they do have expressive limitations. For some reasoning problems it is necessary to infer the existence of new individuals satisfying stated condition. This kind of problems can not be fully resolved by OWL and SWRL. We present the XSWRL (Extended Semantic Web Rule Language), an extension to SWRL, to overcome these problems. XSWRL introduces existentially quantified variables to rules. XSWRL extends SWRL in a syntactically and semantically coherent manner. We show that while the expressiveness of the Semantic Web language is improved, the undecidability and infinite chains are brought on. We define the inseparable set of atoms to separate XSWRL rules, and discuss a prototype implementation of reasoning support for XSWRL. [ABSTRACT FROM AUTHOR]

A general web rule (markup) language has several purposes. It may serve as a lingua franca to exchange rules between different systems and tools. It may be used to express derivation rules for enriching web ontologies by adding definitions of derived concepts or for defining data access permissions; to describe and publish the reactive behaviour of a system in the form of reaction rules; and to provide a complete XML-based specification of a software agent. Further uses may arise in novel web applications. In this paper, we consider the problem of how to design a general web rule language that can be used for these and for future emerging purposes. Given the great diversity of rule concepts and existing rule languages, such a language will consist of several overlapping sublanguages that share a common metamodel. The development of this rule metamodel is a difficult conceptualisation and integration problem. [ABSTRACT FROM AUTHOR]