TITLE

METAMODELLING ARCHITECTURE FOR MODELLING DOMAINS WITH DIFFERENT MATHEMATICAL STRUCTURE

AUTHOR(S)
Mezhuyev
PUB. DATE
July 2014
SOURCE
Journal of Engineering & Applied Sciences;Jul2014, Vol. 9 Issue 7, p1031
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The new metamodelling approach for domain specific modelling is proposed in the paper. The additional level of the metamodelling architecture is introduced, which gives the possibility of metamodels development in the different mathematical semantics. This allows to take into account the mathematical structure of modelled domains, and to use the mathematical operations for development of new effective methods for solving domain specific tasks. The applicability of the approach for development of metamodels for modelling different domains is shown.
ACCESSION #
97273150

 

Related Articles

  • Non-determinism in Gödel's System T. Kristiansen, Lars; Mender, Bedeho // Theory of Computing Systems;Jul2012, Vol. 51 Issue 1, p85 

    The calculus T is a successor-free version of Gödel's T. It is well known that a number of important complexity classes, like e.g. the classes logspace, $\mbox{\sc p}$, $\mbox{\sc linspace}$, $\mbox{\sc etime}$ and $\mbox{\sc pspace}$, are captured by natural fragments of T and related...

  • A survey of computational calculi used in musical applications. Sarria M., Gerardo M. // Ingeniería y Competitividad;dic2013, Vol. 15 Issue 2, p103 

    During the last decades, several formal models have been proposed to formalize musical applications, to solve musical and improvisation problems, and to prove properties in music. In this paper, we briefly describe some of those formal models (computational calculi). We provide a description of...

  • AN “i” FOR AN i: SINGULAR TERMS, UNIQUENESS, AND REFERENCE. SHAPIRO, STEWART // Review of Symbolic Logic;Sep2012, Vol. 5 Issue 3, p380 

    There is an interesting logical/semantic issue with some mathematical languages and theories. In the language of (pure) complex analysis, the two square roots of −1 are indiscernible: anything true of one of them is true of the other. So how does the singular term ‘i’ manage...

  • Socratic Proofs. Wiśniewski, Andrzej // Journal of Philosophical Logic;Jun2004, Vol. 33 Issue 3, p299 

    Our aim is to express in exact terms the old idea of solving problems by pure questioning. We consider the problem of derivability: “Is A derivable from Δ by classical propositional logic?”. We develop a calculus of questions E*; a proof (called a Socratic proof) is a sequence of...

  • THE TWO-BY-TWO ARRAY: AN AID IN CONCEPTUALIZATION AND PROBLEM SOLVING. Eberhart, James // Mathematics & Computer Education;Winter2004, Vol. 38 Issue 1, p92 

    Explores the general utility of two-by-two arrays and its use in conceptualization and problem solving. Enumeration of possible outcomes; Mechanics for determining which theory is appropriate; Medical tests and hypothesis testing.

  • CONCEPTUAL FRAMEWORK FOR RECURSION IN COMPUTER PROGRAMMING. SABAH AL-FEDAGHI // Journal of Theoretical & Applied Information Technology;12/31/2012, Vol. 46 Issue 2, p983 

    Recursion is an important concept and a fundamental problem-solving technique in computer science. Studies have reported that it is considered a very difficult concept for students to learn and teachers to teach, and students have many misconceptions about recursion. Tools proposed to overcome...

  • FINITE MODELS CONSTRUCTED FROM CANONICAL FORMULAS. Moss, Lawrence // Journal of Philosophical Logic;Dec2007, Vol. 36 Issue 6, p605 

    This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves. This line of work began with Fine (Notre Dame J. Form. Log. 16:229–237, 1975). There are two ways in which our work advances on that paper:...

  • Vibration Control of MDOF Structure under Earthquake Excitation using Passive Control and Active Control. Karimi, M. Reza Bagerzadeh; Karimi, M. Mahdi Bagerzadeh // World Academy of Science, Engineering & Technology;Aug2011, Issue 56, p320 

    In the present paper, active control system is used in different heights of the building and the most effective part was studied where the active control system is applied. The mathematical model of the building is established in MATLAB and in order to active control the system FLC method was...

  • Strong normalization in some temporal substructural logics. Kamide, Norihiro // Journal of Logic & Computation;Feb2013, Vol. 23 Issue 1, p1 

    Strong normalization theorems are uniformly proved for typed lambda calculi for a family of temporal substructural logics including some temporal non-commutative logics.

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics