Fast modularisation and aomic decomposition of ontologies using axiom dependency hypergraphs

In this paper we define the notion of an axiom dependency hypergraph, which explicitly represents how axioms are included into a module by the algorithm for computing locality-based modules. A locality-based module of an ontology corresponds to a set of connected nodes in the hypergraph, and atoms of an ontology to strongly connected components. Collapsing the strongly connected components into single nodes yields a condensed hypergraph that comprises a representation of the atomic decomposition of the ontology. To speed up the condensation of the hypergraph, we first reduce its size by collapsing the strongly connected components of its graph fragment employing a linear time graph algorithm. This approach helps to significantly reduce the time needed for computing the atomic decomposition of an ontology. We provide an experimental evaluation for computing the atomic decomposition of large biomedical ontologies. We also demonstrate a significant improvement in the time needed to extract locality-based modules from an axiom dependency hypergraph and its condensed version

Optimizing the computation of overriding

We introduce optimization techniques for reasoning in DLN---a recently introduced family of nonmonotonic description logics whose characterizing features appear well-suited to model the applicative examples naturally arising in biomedical domains and semantic web access control policies. Such optimizations are validated experimentally on large KBs with more than 30K axioms. Speedups exceed 1 order of magnitude. For the first time, response times compatible with real-time reasoning are obtained with nonmonotonic KBs of this size

System Concepts and Formal Modelling Methods for Business Processes

The major quality breakthrough of the 1980s was the realisation by management that business and manufacturing processes are the key to customer service and organisational performance. This thesis is concerned with the overall problem of modelling of business processes. Of special interest is the study of business processes through an interdisciplinary approach that cuts across the boundaries of management and information technology. The overall effort is placed on being able to move from a purely conceptual level of describing a business process to a more formal one, enabling decision making, and driving the analysis away from experience, intuition, and informal debate. The extended review and presentation of the various modelling methodologies given here, serve as a guide to their basic concepts and capabilities. A particular case study - the management of the human resources in a consulting company - has been used in this thesis to enable the evaluation of the modelling techniques. Hence, models have been produced, as well as simulation results to indicate the limitations, the advantages and the information gained. Through this application, the understanding of requirements for modelling analysis and decision making of business processes was acquired. Particularly, two very important techniques were investigated. System Dynamics and Petri nets provide the answers when process models are geared to deliver not only qualitative but also quantitative results. However, Petri nets provide the mathematical notation and the plethora of analysis tools needed for the validation, verification, and performance analysis of the model. Additionally, two different simulation software packages were used, based on these methodologies; Ithink®, which is based on System Dynamics, and Alpha/Sim®, based on Petri nets theory. The model produced in the case study depicts perfectly the capabilities of the two techniques. Petri nets is not the total business modelling solution, it can be complemented by other methods, such as System Dynamics and discrete-time modelling as shown in Chapter 6. The feasibility of all these modelling techniques lies entirely on the analyst, who should use them alternately to satisfy the requirements of the problem