In order to evaluate the concept mappings from TIPA to ArchiMate, we will perform a BWW (Wand and Weber 1993) analysis according to two criteria: completeness and clarity. The Bunge-Wand-Weber Model provides an ontological evaluation of grammars method, where we compare two sets of concepts to identify four ontological deficiencies: 1. Incompleteness: can each element from the first set be mapped on an element from the second? – The mapping is incomplete if it is not total. 2. Redundancy: are the first set elements mapped to more than a second set element? – The mapping is redundant if it is ambiguous. 3. Excess: is every first set element mapped on a second set one? – The mapping is excessive if there are first set elements without a relationship. 4. Overload: is every first set element mapped to exactly one second set element? – The mapping is overloaded if any second set element has more than one mapping to a first set one. The amount of TIPA concepts that have no representation in ArchiMate defines the lack of completeness. Clarity is a combination of redundancy, overload and excess of concepts. Lack of completeness can be a serious issue while lack of clarity can make the mapping unidirectional and hard to reverse. Considering all the above, we can say our mapping is complete, because every TIPA concept has an ArchiMate representation of itself. Furthermore, ArchiMate concepts can be so generic in a way that can accommodate some TIPA concepts, meaning sometimes the mapping does not reflect exactly the actual element meaning, but its generic meaning. We take advantage of this, through a set of assumptions, in order to achieve completeness. However, an extension to specialize and accurately represent these concepts would be ... ... middle of paper ... ... Centre Henri Tudor: Béatrix Barafort, Valérie Betry, Stéphane Cortina, Michel Picard, Marc St-Jean, Alain Renault and OV (2009) ITSM Process Assessment Supporting ITIL. Van Haren Publishing 20. Renault A, Barafort B (2014) TIPA for ITIL – from genesis to maturity of SPICE applied to ITIL 2011. 21st Eur. Software, Syst. Serv. Process Improv. Innov. 21. Sante T, Ermers J (2009) TOGAF 9 and ITIL v3 Two Frameworks Whitepaper. Getronics Consult. OGC 22. Vicente M, Gama N, Silva MM Da (2013) Using ArchiMate to Represent ITIL Metamodel. 2013 IEEE 15th Conf Bus Informatics 270–275. 23. Wand Y, Weber R (1993) On the Ontological Expressiveness of Information Systems Analysis and Design Grammars. Inf Syst J 3:217–237. doi: 10.1111/j.1365-2575.1993.tb00127.x 24. Zachman JA (1987) A framework for information systems architecture. IBM Syst J 26:276–292. doi: 10.1147/sj.263.0276
Croft, William, and D A. Cruse. Cognitive Linguistics. Cambridge, U.K: Cambridge University Press, 2004. USC Upstate Ebook. Web. 27 February 2011.
its workings was created. In both works, there is a concept of a fixed order of
Stage 3 involves creating an Architectural Model version of the whole system including sub systems. A Viewpoint Hierarchy shows a skeleton version of the system which can be ins...
Rizzi (1997) depends on a few features, that syntactic movement is “last resort” or that it must be a necessary “quasi-morphological” requirement, and that these requirements are Criteria requirements, “the presence of a head entering into the required Spec-head configuration with the preposed phrase”. Criteria requirements, unlike feature checking, will not disappear. Finally, Rizzi must also assume within the relativized minimality theory, Empty Category Principle (ECP), and the Head Movement Constraint (HMC) and therefore head government. The rele...
...ter may use several words that can be grouped together into one word. An example of this would be :
ABSTRACT: A Dedekind algebra is an ordered pair (B, h) where B is a non-empty set and h is a "similarity transformation" on B. Among the Dedekind algebras is the sequence of positive integers. Each Dedekind algebra can be decomposed into a family of disjointed, countable subalgebras which are called the configurations of the algebra. There are many isomorphic types of configurations. Each Dedekind algebra is associated with a cardinal value function called the confirmation signature which counts the number of configurations in each isomorphism type occurring in the decomposition of the algebra. Two Dedekind algebras are isomorphic if their configuration signatures are identical. I introduce conditions on configuration signatures that are sufficient for characterizing Dedekind algebras uniquely up to isomorphisms in second order logic. I show Dedekind's characterization of the sequence of positive integers to be a consequence of these more general results, and use configuration signatures to delineate homogeneous, universal and homogeneous-universal Dedekind algebras. These delineations establish various results about these classes of Dedekind algebras including existence and uniqueness.
Copi, Irving M. and Cohen, Carl. Introduction to Logic, Eleventh Edition. Upper Saddle River, NJ: Pearson Education Corp. 2001.
The semiotic theory has a logical foundation of understanding individual’s process of interpreting knowledge objects since it roots in the assumption that a meaning of each sign is produced by the interpretant that mediates between a sign and corresponding knowledge object. One of the three conceptual levels is the level of cognition which is in a relation to perception during the process of interpretation. In Peircian’s perspective, it is argued that “knowledge about a concept relates to previously acquired knowledge, and, therefore, concepts must be defined within a continuum, departing from one knowledge state to a more and
Russell’s Theory of Definite Description has totally changed the way we view definite descriptions by solving the three logical paradoxes. It is undeniable that the theory itself is not yet perfect and there can be objections on this theory. Still, until now, Russell’s theory is the most logical explanation of definite description’s role.
Atomic sentences have truth-values that evaluate the application of a concept to an object that is being referred. To find what the sentence refers to, the referent of the predicate must be applied to the referent of the subject. Connectives are vocabulary like “and”, “if”, and “not” that are functions from truth-values to truth tables. Each of these provide the basis for Frege’s language system such that we are able to speaking in our ordinary language, but still maintain the mathematical connection he attempts to establish early. Frege’s use of language and sentences being functions with variables is consistent with how he defines the basic constructs of what are needed in a human language.
The title of this essay claims that the usefulness of a map in knowledge is limited to its ability to simplify things. Before I discuss this, it is important to look at the key words used in phrasing the claim.
The Logical Hylomorphism is based on a logic which is formal description of a traditional account of what is distinguishing features about logic. The very distinction between the formal and material aspect of all the arguments has been
In this paper I attempt both to explicate the popular, but vague notion of wholeness and to point out its meaning for ontology. To begin with, I’ll give a brief survey of the essentials: In accord with an elementary intuition of ‘wholeness’ I introduce an implicit axiomatic definition of its structure, which proves to be a familiar Boolean-lattice. This internal view of the concept of wholeness is followed by a more philosophical external view, which looks at the structure in its context. It will be shown that the structure corresponds to the criteria of an ontological category, namely consistence, adequacy, content and coherence, so that we are justified in speaking of the ‘category of wholeness’. This feature leads to some interesting results: As a consequence of the adequacy of a category the structure turns out to be a model on its own. The self-application leads on the level of the axioms to the boolean lattice of all substructures and on the level of the terms of axioms to semantical boolean lattices, which may seen as basic units for the whole language. Thus the understanding of the structure of ‘wholeness’ takes for granted that there is a pre-understanding of the very same. Furthermore, there is another kind of circular understanding on the level of the atoms of the structure, because there exists a mutual defineability between the atoms, which cannot be eliminated without leaving the wholeness. But even if we try to leave it, we enter another wholeness, so that circularity is inevitable in the end.
unified because reasoning and problem solving may involve several areas simultaneously. A robot circuitrepair syste m, for instance, needs to reason about circuits in terms of electrical connectivity and physical layout, and about time both for circuit timing analysis and estimating labor costs. The sentences describing time therefore must be capable of being combined w ith those describing spatial layout, and must work equally well for nanoseconds and minutes, and for angstroms and meters. After we present the general ontology, we will apply it to write sentences describing the domain of grocery shopping. A brief reverie on the subject of shopping brings to mind a vast array of topics in need of representation: locations, movement, physical objects, shapes, sizes, grasping, releasing, colors, categories of objects, anchovies, amounts of stuff, nutrition, cooking, nonstick frying pans, taste, time, money, direct debit cards, arithmetic, economics, and so on. The domain is more than adequate to exercise our ontology, and leaves plenty of scope for the reader to do some creative knowledge representation of his or her own. 228 Chapter 8. Building a Knowledge Base Our discussion of the
The set-theoretic representation is one of the ways to represent a planning problem. Given a finite set $L$ of propositions, we can describe the environment as following: