|
Meronomy
A meronomy or partonomy is a type of hierarchy that deals with part–whole relationships, in contrast to a taxonomy whose categorisation is based on discrete sets. Accordingly, the unit of meronomical classification is meron, while the unit of taxonomical classification is taxon. These conceptual structures are used in linguistics and computer science, with applications in biology. The part–whole relationship is sometimes referred to as ''HAS-A'', and corresponds to object composition in object-oriented programming. The study of meronomy is known as ''mereology'', and in linguistics a ''meronym'' is the name given to a constituent part of, a substance of, or a member of something. "X" is a meronym of "Y" if an X is a part of a Y. Example *Cars have parts: engine, headlight, wheel **Engines have parts: crankcase, carburetor **Headlights have parts: headlight bulb, reflector In knowledge representation In formal terms, in the context of knowledge representation and ontologi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mereology
In logic, philosophy and related fields, mereology ( (root: , ''mere-'', 'part') and the suffix ''-logy'', 'study, discussion, science') is the study of parts and the wholes they form. Whereas set theory is founded on the membership relation between a set and its elements, mereology emphasizes the meronomic relation between entities, which—from a set-theoretic perspective—is closer to the concept of inclusion between sets. Mereology has been explored in various ways as applications of predicate logic to formal ontology, in each of which mereology is an important part. Each of these fields provides its own axiomatic definition of mereology. A common element of such axiomatizations is the assumption, shared with inclusion, that the part-whole relation orders its universe, meaning that everything is a part of itself ( reflexivity), that a part of a part of a whole is itself a part of that whole ( transitivity), and that two distinct entities cannot each be a part of the othe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mereology
In logic, philosophy and related fields, mereology ( (root: , ''mere-'', 'part') and the suffix ''-logy'', 'study, discussion, science') is the study of parts and the wholes they form. Whereas set theory is founded on the membership relation between a set and its elements, mereology emphasizes the meronomic relation between entities, which—from a set-theoretic perspective—is closer to the concept of inclusion between sets. Mereology has been explored in various ways as applications of predicate logic to formal ontology, in each of which mereology is an important part. Each of these fields provides its own axiomatic definition of mereology. A common element of such axiomatizations is the assumption, shared with inclusion, that the part-whole relation orders its universe, meaning that everything is a part of itself ( reflexivity), that a part of a part of a whole is itself a part of that whole ( transitivity), and that two distinct entities cannot each be a part of the othe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hierarchy
A hierarchy (from Greek: , from , 'president of sacred rites') is an arrangement of items (objects, names, values, categories, etc.) that are represented as being "above", "below", or "at the same level as" one another. Hierarchy is an important concept in a wide variety of fields, such as architecture, philosophy, design, mathematics, computer science, organizational theory, systems theory, systematic biology, and the social sciences (especially political philosophy). A hierarchy can link entities either directly or indirectly, and either vertically or diagonally. The only direct links in a hierarchy, insofar as they are hierarchical, are to one's immediate superior or to one of one's subordinates, although a system that is largely hierarchical can also incorporate alternative hierarchies. Hierarchical links can extend "vertically" upwards or downwards via multiple links in the same direction, following a path. All parts of the hierarchy that are not linked vertically to one ano ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transitive Relation
In mathematics, a relation on a set is transitive if, for all elements , , in , whenever relates to and to , then also relates to . Each partial order as well as each equivalence relation needs to be transitive. Definition A homogeneous relation on the set is a ''transitive relation'' if, :for all , if and , then . Or in terms of first-order logic: :\forall a,b,c \in X: (aRb \wedge bRc) \Rightarrow aRc, where is the infix notation for . Examples As a non-mathematical example, the relation "is an ancestor of" is transitive. For example, if Amy is an ancestor of Becky, and Becky is an ancestor of Carrie, then Amy, too, is an ancestor of Carrie. On the other hand, "is the birth parent of" is not a transitive relation, because if Alice is the birth parent of Brenda, and Brenda is the birth parent of Claire, then this does not imply that Alice is the birth parent of Claire. What is more, it is antitransitive: Alice can ''never'' be the birth parent of Claire. "Is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Meronymy
In linguistics, meronymy () is a semantic relation between a meronym denoting a part and a holonym denoting a whole. In simpler terms, a meronym is in a ''part-of'' relationship with its holonym. For example, ''finger'' is a meronym of ''hand'' which is its holonym. Similarly, ''engine'' is a meronym of ''car'' which is its holonym. Holonymy () is the converse of meronymy. A closely related concept is that of mereology, which specifically deals with part–whole relations and is used in logic. It is formally expressed in terms of first-order logic. A meronymy can also be considered a partial order. Meronym and holonym refer to ''part'' and ''whole'' respectively, which is not to be confused with hyponym which refers to ''type''. For example, a holonym of ''leaf'' might be ''tree'' (a leaf is a part of a tree), whereas a hyponym of ''oak tree'' might be ''tree'' (an oak tree is a type of tree). See also * Has-a * Hyponymy and hypernymy * Is-a * Mereological nihilism * Synecd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Holonymy
In linguistics, meronymy () is a semantic relation between a meronym denoting a part and a holonym denoting a whole. In simpler terms, a meronym is in a ''part-of'' relationship with its holonym. For example, ''finger'' is a meronym of ''hand'' which is its holonym. Similarly, ''engine'' is a meronym of ''car'' which is its holonym. Holonymy () is the converse of meronymy. A closely related concept is that of mereology, which specifically deals with part–whole relations and is used in logic. It is formally expressed in terms of first-order logic. A meronymy can also be considered a partial order. Meronym and holonym refer to ''part'' and ''whole'' respectively, which is not to be confused with hyponym which refers to ''type''. For example, a holonym of ''leaf'' might be ''tree'' (a leaf is a part of a tree), whereas a hyponym of ''oak tree'' might be ''tree'' (an oak tree is a type of tree). See also * Has-a * Hyponymy and hypernymy * Is-a * Mereological nihilism * Synecd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Meronymy
In linguistics, meronymy () is a semantic relation between a meronym denoting a part and a holonym denoting a whole. In simpler terms, a meronym is in a ''part-of'' relationship with its holonym. For example, ''finger'' is a meronym of ''hand'' which is its holonym. Similarly, ''engine'' is a meronym of ''car'' which is its holonym. Holonymy () is the converse of meronymy. A closely related concept is that of mereology, which specifically deals with part–whole relations and is used in logic. It is formally expressed in terms of first-order logic. A meronymy can also be considered a partial order. Meronym and holonym refer to ''part'' and ''whole'' respectively, which is not to be confused with hyponym which refers to ''type''. For example, a holonym of ''leaf'' might be ''tree'' (a leaf is a part of a tree), whereas a hyponym of ''oak tree'' might be ''tree'' (an oak tree is a type of tree). See also * Has-a * Hyponymy and hypernymy * Is-a * Mereological nihilism * Synecd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Language
In neuropsychology, linguistics, and philosophy of language, a natural language or ordinary language is any language that has evolved naturally in humans through use and repetition without conscious planning or premeditation. Natural languages can take different forms, such as speech or signing. They are distinguished from constructed and formal languages such as those used to program computers or to study logic. Defining natural language Natural language can be broadly defined as different from * artificial and constructed languages, e.g. computer programming languages * constructed international auxiliary languages * non-human communication systems in nature such as whale and other marine mammal vocalizations or honey bees' waggle dance. All varieties of world languages are natural languages, including those that are associated with linguistic prescriptivism or language regulation. ( Nonstandard dialects can be viewed as a wild type in comparison with standard l ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
SKOS
Simple Knowledge Organization System (SKOS) is a W3C recommendation designed for representation of thesauri, classification schemes, taxonomies, subject-heading systems, or any other type of structured controlled vocabulary. SKOS is part of the Semantic Web family of standards built upon RDF and RDFS, and its main objective is to enable easy publication and use of such vocabularies as linked data. History DESIRE II project (1997–2000) The most direct ancestor to SKOS was the RDF Thesaurus work undertaken in the second phase of the EU DESIRE project . Motivated by the need to improve the user interface and usability of multi-service browsing and searching, a basic RDF vocabulary for Thesauri was produced. As noted later in the SWAD-Europe workplan, the DESIRE work was adopted and further developed in the SOSIG and LIMBER projects. A version of the DESIRE/SOSIG implementation was described in W3C's QL'98 workshop, motivating early work on RDF rule and query languages: A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Web Ontology Language
The Web Ontology Language (OWL) is a family of knowledge representation languages for authoring ontologies. Ontologies are a formal way to describe taxonomies and classification networks, essentially defining the structure of knowledge for various domains: the nouns representing classes of objects and the verbs representing relations between the objects. Ontologies resemble class hierarchies in object-oriented programming but there are several critical differences. Class hierarchies are meant to represent structures used in source code that evolve fairly slowly (perhaps with monthly revisions) whereas ontologies are meant to represent information on the Internet and are expected to be evolving almost constantly. Similarly, ontologies are typically far more flexible as they are meant to represent information on the Internet coming from all sorts of heterogeneous data sources. Class hierarchies on the other hand tend to be fairly static and rely on far less diverse and more structu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Antisymmetric Relation
In mathematics, a binary relation R on a set X is antisymmetric if there is no pair of ''distinct'' elements of X each of which is related by R to the other. More formally, R is antisymmetric precisely if for all a, b \in X, \text \,aRb\, \text \,a \neq b\, \text \,bRa\, \text, or equivalently, \text \,aRb\, \text \,bRa\, \text \,a = b. The definition of antisymmetry says nothing about whether aRa actually holds or not for any a. An antisymmetric relation R on a set X may be reflexive (that is, aRa for all a \in X), irreflexive (that is, aRa for no a \in X), or neither reflexive nor irreflexive. A relation is asymmetric if and only if it is both antisymmetric and irreflexive. Examples The divisibility relation on the natural numbers is an important example of an antisymmetric relation. In this context, antisymmetry means that the only way each of two numbers can be divisible by the other is if the two are, in fact, the same number; equivalently, if n and m are distinct and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
