a b s t r a c tAn ontology represents a consensus on the representation of the concepts and axioms of a given domain. This consensus is often reached through an iterative process, each iteration consisting in modifying the current version of the consensus. Furthermore, frequent and continuous changes are also occurring when the represented domain evolves or when new requirements have to be considered. Consequently, ontologies have to be adaptable to handle evolution, revision and refinement. However, this process is highly challenging as it is often difficult to understand all affected ontology parts when changes are performed. Thus, inconsistencies can occur in the ontology as the changes can introduce contradictory axioms. To address this issue, this paper presents a formal approach for evolving ontologies using Typed Graph Grammars. This method relies on the algebraic approach Simple PushOut (SPO) of graph transformations. It formalizes the ontology changes and proposes an a priori approach of inconsistencies resolution. The modified ontology does not need an explicit checking as an incorrect ontology version cannot actually be generated. To validate our proposal, an implementation is presented using the Attributed Graph Grammar (AGG) toolbox.
Ontologies are often used for the meta-modelling of dynamic domains, therefore it is essential to represent and manage their changes and to adapt them to new requirements. Due to changes, an ontology may become invalid and non-interpretable. This paper proposes the use of the graph grammars to formalize and manage ontologies evolution. The objective is to present an a priori approach of inconsistencies resolutions to adapt the ontologies and preserve their consistency. A framework composed of different graph rewriting rules is proposed and presented using the AGG (Algebraic Graph Grammar) tool. As an application, the article considers the EventCCAlps ontology developed within the CCAlps European project.
The conception of an ontology is a complex task influenced by numerous factors like the point of view of the authors or the level of details. Consequently, several ontologies have been developed to model identical or related domains leading to partially overlapping representations. This divergence of conceptualization requires the study of ontologies merging in order to create a common repository of knowledge and integrate various sources of information. In this paper, we propose a formal approach for merging ontologies using typed graph grammars. This method relies on the algebraic approach to graph transformations, SPO (Simple PushOut) which allows a formal representation and ensures the consistence of the results. Furthermore, a new ontologies merging algorithm called GROM (Graph Rewriting for Ontology Merging) is presented.
Ada95 is a powerful language with a great number of original constructions. Learning these constructions requires the finalization of projects that are both interesting and motivating for students, as well as the coverage of the different constructions during the project. Moreover, the field of mobile robotics is one that requires real-time programming and appropriate software architectures. More particularly, legged robots offer a real challenge as regards autonomy and the coordination of movements of the different legs. This field proves fruitful for the definition of projects on concurrent programming. The present paper describes such a project about an architecture for an omnidirectional legged robot. In a resolutely object-oriented approach, the project helps to teach the main constructions of the Ada language. Among others, it deals with child units, generics, tagged types and type extension, tasking, protected objects, family entries, asynchronous transfer of control, discriminants, etc. Numerous extensions can be considered within this project.
While reuse is typically considered a good practice, it may also lead to keeping irrelevant concerns in derived elements. For instance, new metamodels are usually built upon existing metamodels using additive techniques such as profiling and package merge. With such additive techniques, new metamodels tend to become bigger and bigger, which leads to harmful overheads of complexity for both tool builders and users. In this paper, we introduce «package unmerge»-a proposal for a subtractive relation between packages-which complements existing metamodel-extension techniques.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.