9,207 research outputs found

    Drawing OWL 2 ontologies with Eddy the editor

    Get PDF
    In this paper we introduce Eddy, a new open-source tool for the graphical editing of OWL~2 ontologies. Eddy is specifically designed for creating ontologies in Graphol, a completely visual ontology language that is equivalent to OWL~2. Thus, in Eddy ontologies are easily drawn as diagrams, rather than written as sets of formulas, as commonly happens in popular ontology design and engineering environments. This makes Eddy particularly suited for usage by people who are more familiar with diagramatic languages for conceptual modeling rather than with typical ontology formalisms, as is often required in non-academic and industrial contexts. Eddy provides intuitive functionalities for specifying Graphol diagrams, guarantees their syntactic correctness, and allows for exporting them in standard OWL 2 syntax. A user evaluation study we conducted shows that Eddy is perceived as an easy and intuitive tool for ontology specification

    VPOET: Using a Distributed Collaborative Platform for Semantic Web Applications

    Get PDF
    This paper describes a distributed collaborative wiki-based platform that has been designed to facilitate the development of Semantic Web applications. The applications designed using this platform are able to build semantic data through the cooperation of different developers and to exploit that semantic data. The paper shows a practical case study on the application VPOET, and how an application based on Google Gadgets has been designed to test VPOET and let human users exploit the semantic data created. This practical example can be used to show how different Semantic Web technologies can be integrated into a particular Web application, and how the knowledge can be cooperatively improved.Comment: accepted for the 2nd International Symposium on Intelligent Distributed Computing - IDC'2008. September 18-20, 2008, Catania, Ital

    An ontology-based approach towards coupling task and path planning for the simulation of manipulation tasks

    Get PDF
    This work deals with the simulation and the validation of complex manipulation tasks under strong geometric constraints in virtual environments. The targeted applications relate to the industry 4.0 framework; as up-to-date products are more and more integrated and the economic competition increases, industrial companies express the need to validate, from design stage on, not only the static CAD models of their products but also the tasks (e.g., assembly or maintenance) related to their Product Lifecycle Management (PLM). The scientific community looked at this issue from two points of view: - Task planning decomposes a manipulation task to be realized into a sequence of primitive actions (i.e., a task plan) - Path planning computes collision-free trajectories, notably for the manipulated objects. It traditionally uses purely geometric data, which leads to classical limitations (possible high computational processing times, low relevance of the proposed trajectory concerning the task to be performed, or failure); recent works have shown the interest of using higher abstraction level data. Joint task and path planning approaches found in the literature usually perform a classical task planning step, and then check out the feasibility of path planning requests associated with the primitive actions of this task plan. The link between task and path planning has to be improved, notably because of the lack of loopback between the path planning level and the task planning level: - The path planning information used to question the task plan is usually limited to the motion feasibility where richer information such as the relevance or the complexity of the proposed path would be needed; - path planning queries traditionally use purely geometric data and/or ā€œblindā€ path planning methods (e.g., RRT), and no task-related information is used at the path planning level Our work focuses on using task level information at the path planning level. The path planning algorithm considered is RRT; we chose such a probabilistic algorithm because we consider path planning for the simulation and the validation of complex tasks under strong geometric constraints. We propose an ontology-based approach to use task level information to specify path planning queries for the primitive actions of a task plan. First, we propose an ontology to conceptualize the knowledge about the 3D environment in which the simulated task takes place. The environment where the simulated task takes place is considered as a closed part of 3D Cartesian space cluttered with mobile/fixed obstacles (considered as rigid bodies). It is represented by a digital model relying on a multilayer architecture involving semantic, topologic and geometric data. The originality of the proposed ontology lies in the fact that it conceptualizes heterogeneous knowledge about both the obstacles and the free space models. Second, we exploit this ontology to automatically generate a path planning query associated to each given primitive action of a task plan. Through a reasoning process involving the primitive actions instantiated in the ontology, we are able to infer the start and the goal configurations, as well as task-related geometric constraints. Finally, a multi-level path planner is called to generate the corresponding trajectory. The contributions of this work have been validated by full simulation of several manipulation tasks under strong geometric constraints. The results obtained demonstrate that using task-related information allows better control on the RRT path planning algorithm involved to check the motion feasibility for the primitive actions of a task plan, leading to lower computational time and more relevant trajectories for primitive actions

    A formal verification framework and associated tools for enterprise modeling : application to UEML

    Get PDF
    The aim of this paper is to propose and apply a verification and validation approach to Enterprise Modeling that enables the user to improve the relevance and correctness, the suitability and coherence of a model by using properties specification and formal proof of properties

    Semantics for incident identification and resolution reports

    Get PDF
    In order to achieve a safe and systematic treatment of security protocols, organizations release a number of technical briefings describing how to detect and manage security incidents. A critical issue is that this document set may suffer from semantic deficiencies, mainly due to ambiguity or different granularity levels of description and analysis. An approach to face this problem is the use of semantic methodologies in order to provide better Knowledge Externalization from incident protocols management. In this article, we propose a method based on semantic techniques for both, analyzing and specifying (meta)security requirements on protocols used for solving security incidents. This would allow specialist getting better documentation on their intangible knowledge about them.Ministerio de EconomĆ­a y Competitividad TIN2013-41086-

    On relating functional modeling approaches: abstracting functional models from behavioral models

    Get PDF
    This paper presents a survey of functional modeling approaches and describes a strategy to establish functional knowledge exchange between them. This survey is focused on a comparison of function meanings and representations. It is argued that functions represented as input-output flow transformations correspond to behaviors in the approaches that characterize functions as intended behaviors. Based on this result a strategy is presented to relate the different meanings of function between the approaches, establishing functional knowledge exchange between them. It is shown that this strategy is able to preserve more functional information than the functional knowledge exchange methodology of Kitamura, Mizoguchi, and co-workers. The strategy proposed here consists of two steps. In step one, operation-on-flow functions are translated into behaviors. In step two, intended behavior functions are derived from behaviors. The two-step strategy and its benefits are demonstrated by relating functional models of a power screwdriver between methodologies

    Web 2.0, language resources and standards to automatically build a multilingual named entity lexicon

    Get PDF
    This paper proposes to advance in the current state-of-the-art of automatic Language Resource (LR) building by taking into consideration three elements: (i) the knowledge available in existing LRs, (ii) the vast amount of information available from the collaborative paradigm that has emerged from the Web 2.0 and (iii) the use of standards to improve interoperability. We present a case study in which a set of LRs for diļ¬€erent languages (WordNet for English and Spanish and Parole-Simple-Clips for Italian) are extended with Named Entities (NE) by exploiting Wikipedia and the aforementioned LRs. The practical result is a multilingual NE lexicon connected to these LRs and to two ontologies: SUMO and SIMPLE. Furthermore, the paper addresses an important problem which aļ¬€ects the Computational Linguistics area in the present, interoperability, by making use of the ISO LMF standard to encode this lexicon. The diļ¬€erent steps of the procedure (mapping, disambiguation, extraction, NE identiļ¬cation and postprocessing) are comprehensively explained and evaluated. The resulting resource contains 974,567, 137,583 and 125,806 NEs for English, Spanish and Italian respectively. Finally, in order to check the usefulness of the constructed resource, we apply it into a state-of-the-art Question Answering system and evaluate its impact; the NE lexicon improves the systemā€™s accuracy by 28.1%. Compared to previous approaches to build NE repositories, the current proposal represents a step forward in terms of automation, language independence, amount of NEs acquired and richness of the information represented

    Tuple-based morphisms for interoperability establishment of financial information models

    Get PDF
    DissertaĆ§Ć£o apresentada na Faculdade de CiĆŖncias e Tecnologia da Universidade Nova de Lisboa para obtenĆ§Ć£o do grau de Mestre em Engenharia ElectrotĆ©cnica e ComputadoresThe current financial crisis has demonstrated that there is a need for financial accounting data in a format which can be rapidly analyzed and exchanged. The appearance of XBRL in 2000 has helped create a ā€˜de factoā€™ standard data format for the exchange of financial information. However, XBRL by itself is not capable of ensuring a common semantic for the exchange of accounting information. Additionally, the existence of different accounting standards in different countries is a hindrance to efficient analysis and evaluation of companies by international analysts or investors. Therefore, there is a need to not only use a more advanced data format, but also for tools which can facilitate the exchange of accounting data, in particular when different accounting standards are used. This dissertation presents a tuple-based semantic and structural mapping for interoperability establishment of financial information models based on the use of ontologies and a ā€˜Communication Mediatorā€™. It allows the mapping of accounting concepts of different accounting standards to be stored in the ā€˜Communication Mediatorā€™. The mapping stored contains an ATL code expression, which with the aid of model transformation tools, can be utilized to perform the mapping between two different accounting models

    Incommensurability and rationality in engineering design: the case of functional decomposition

    Get PDF
    In engineering design research different models of functional decomposition are advanced side-by-side. In this paper I explain and validate this co-existence of models in terms of the Kuhnian thesis of methodological incommensurability. I advance this analysis in terms of the thesisā€™ construal of (non-algorithmic) theory choice in terms of values, expanding this notion to the engineering domain. I further argue that the (by some) implicated threat of the thesis to rational theory choice has no force in the functional decomposition case: co-existence of different models of functional decomposition is rational from an instrumental point of view. My explanation covers cases in which different models are advanced as means for the same objective. Such cases cannot be explicated with the explanatory construct of variety in objectives, as advanced in other analyses of co-existing conceptualizations in engineering
    • ā€¦
    corecore