ISO/IEC 11179-32:2023 情報技術 — メタデータ レジストリ (MDR) — Part 32: 概念システム登録のメタモデル | ページ 6

3.1

concept

unit of knowledge created by a unique combination of characteristics

Note 1 to entry: Concepts are not necessarily bound to particular natural languages. They are, however, influenced by the social or cultural background which often leads to different categorizations.

Note 2 to entry: This is the concept “concept” as used and designated by the term “concept” in terminology work. It is a very different concept from that designated by other domains such as industrial automation or marketing.

Note 3 to entry: A concept is independent of its representation.

[SOURCE:ISO 1087:2019, 3.2.7, modified — Reference to definition of characteristics removed. Note 3 to entry added.]

3.2

concept system

system of concepts

set of concepts (3.1) structured in one or more related domains according to the concept relations (3.3) among its concepts

[SOURCE:ISO 1087:2019, 3.2.28]

3.3

relation

concept relation

sense in which concepts (3.1) may be connected, via constituent relation roles (3.4)

Note 1 to entry: The related concepts may be general or individual concepts.

3.4

relation role

role (3.5) that a concept (3.1) plays in a relation (3.3)

3.5

role

specified responsibilities

3.6

link

member of a relation (3.3)

3.7

link end

end of a link (3.6) , identifying the relation role (3.4) played by a concept (3.1) in the link

3.8

binary relation

relation (3.3) with arity (3.9) equal to 2 (i.e. whose members all have two ends)

Note 1 to entry: Most common semantic relations are binary, e.g. “equals”, “less than”, “greater than”, “is part of”, etc. An example of a relation which is not binary is “betweenness” (e.g. A is between B and C.).

3.9

arity

number of arguments that a function takes

3.10

reflexivity

characterization of a binary relation (3.8) as reflexive, irreflexive or antireflexive

Note 1 to entry: A binary relation, R, is reflexive if for all x, R(x,x) is true. Equality is an example of a reflexive relation.

Note 2 to entry: A binary relation, R, is irreflexive if it is not reflexive. i.e., R(x,x) is not necessarily true for all x.

Note 3 to entry: A binary relation, R, is antireflexive if for all x, R(x,x) is false. Inequality is an example of an antireflexive relation. An antireflexive relation is also irreflexive, but antireflexive is a more specific characterization.

3.11

symmetry

characterization of a binary relation (3.8) as symmetric, asymmetric or antisymmetric

Note 1 to entry: A binary relation, R, is symmetric if for all x, y: R(x,y) implies R(y,x).

Note 2 to entry: Symmetry does not imply reflexivity (3.18) .

Note 3 to entry: A binary relation, R, is asymmetric if for all x,y: R(x,y) does not imply R(y,x).

Note 4 to entry: A binary relation, R, is anti-symmetric if for all x,y: R(x,y) implies not R(y,x). An antisymmetric relation is also asymmetric, but antisymmetric is a more specific characterization.

Note 5 to entry: An asymmetric relation is not necessarily antisymmetric.

3.12

transitivity

characterization of a binary relation (3.8) as: transitive, intransitive or antitransitive

Note 1 to entry: A binary relation, R, is transitive, if for all x,y,z: R(x,y) and R(y,z) implies R(x,z). Examples of transitive relations include equality, less than and less than or equals.

Note 2 to entry: A binary relation, R, is intransitive if it is not transitive i.e. R(x,y) and R(y,z) does not imply R(x,z).

Note 3 to entry: A binary relation, R, is antitransitive if for all x,y,z: R(x,y) and R(y,z) implies not R(x,z).

Note 4 to entry: An antitransitive relation is also intransitive, but antitransitive is a more specific characterization.

3.13

object

anything perceivable or conceivable

Note 1 to entry: Objects can be material (e.g. “engine”, “sheet of paper”, “diamond”), immaterial (e.g. “conversion ratio”, “project plan”) or imagined (e.g. “unicorn”, “scientific hypothesis”).

[SOURCE:ISO 1087:2019, 3.1.1]

3.14

property

feature of an object (3.13)

Note 1 to entry: One or more objects can have the same property.

[SOURCE:ISO 1087:2019, 3.1.3]

3.15

characteristic

abstraction of a property (3.14)

Note 1 to entry: Characteristics are used for describing concepts (3.6) .

[SOURCE:ISO 1087:2019, 3.2.1]

3.16

notation

formal syntax and associated semantics for the representation of information

Note 1 to entry: A formal syntax consists of a set of symbols and the rules for their use.

Note 2 to entry: Formal syntax is often intended for machine processing.

[SOURCE:ISO/IEC 11179-3:2023, 3.2.36]

3.17

assertion

sentence or proposition in logic which is asserted (or assumed) to be true

3.18

cardinality

number of elements in a set

Note 1 to entry: cf. multiplicity (3.19)

Note 2 to entry: Adapted from ISO/IEC 19501:2005,^[5] Glossary.

3.19

multiplicity

specification of the range of allowable cardinalities (3.18) that a set may assume

Note 1 to entry: Multiplicity specifications may be given for roles within associations (ISO/IEC 11179-3:2023, 3.1.5)

Note 2 to entry: A multiplicity is a (possibly infinite) subset of the nonnegative integers

Note 3 to entry: Adapted from ISO/IEC 19501:2005,^[5] Glossary.

3.20

taxonomy

type of hierarchy which deals with generalization/specialization relationships

Note 1 to entry: cf. meronomy (3.21)

3.21

meronomy

type of hierarchy which deals with part-whole relationships

Note 1 to entry: cf. taxonomy (3.20)