|
Meronomy
A meronomy or is a hierarchical taxonomy that deals with part–whole relationships. For example, a car has parts that include engine, body and wheels; and the body has parts that include doors and windows. 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. The unit of organisation that corresponds to the taxonomical taxon is the meron. Example *Cars have parts: engine, headlight, wheel **Engines have parts: crankcase, carburetor **Headlights have parts: headlight bulb, reflector **Wheels have parts: rim, spokes In knowledge representation In formal terms, in the conte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Taxonomy
image:Hierarchical clustering diagram.png, 280px, Generalized scheme of taxonomy Taxonomy is a practice and science concerned with classification or categorization. Typically, there are two parts to it: the development of an underlying scheme of classes (a taxonomy) and the allocation of things to the classes (classification). Originally, taxonomy referred only to the Taxonomy (biology), classification of organisms on the basis of shared characteristics. Today it also has a more general sense. It may refer to the classification of things or concepts, as well as to the principles underlying such work. Thus a taxonomy can be used to organize species, documents, videos or anything else. A taxonomy organizes taxonomic units known as "taxa" (singular "taxon"). Many are hierarchy, hierarchies. One function of a taxonomy is to help users more easily find what they are searching for. This may be effected in ways that include a library classification system and a Taxonomy for search e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reflexive Relation
In mathematics, a binary relation R on a set X is reflexive if it relates every element of X to itself. An example of a reflexive relation is the relation " is equal to" on the set of real numbers, since every real number is equal to itself. A reflexive relation is said to have the reflexive property or is said to possess reflexivity. Along with symmetry and transitivity, reflexivity is one of three properties defining equivalence relations. Etymology The word ''reflexive'' is originally derived from the Medieval Latin ''reflexivus'' ('recoiling' reflex.html" ;"title="f. ''reflex">f. ''reflex'' or 'directed upon itself') (c. 1250 AD) from the classical Latin ''reflexus-'' ('turn away', 'reflection') + ''-īvus'' (suffix). The word entered Early Modern English in the 1580s. The sense of the word meaning 'directed upon itself', as now used in mathematics, surviving mostly by its use in philosophy and grammar (cf. ''Reflexive verb'' and ''Reflexive pronoun''). The first e ... [...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. Fellow meronyms (naming the various fellow parts of any particular whole) are called comeronyms (for example, ''leaves'', ''branches'', ''trunk'', and ''roots'' are comeronyms under the holonym of ''tree''). 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 hypernym which refers to ''type''. For example, a holonym of ''leaf'' mig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mereology
Mereology (; from Greek μέρος 'part' (root: μερε-, ''mere-'') and the suffix ''-logy'', 'study, discussion, science') is the philosophical study of part-whole relationships, also called ''parthood relationships''. As a branch of metaphysics, mereology examines the connections between parts and their wholes, exploring how components interact within a system. This theory has roots in ancient philosophy, with significant contributions from Plato, Aristotle, and later, medieval and Renaissance thinkers like Thomas Aquinas and John Duns Scotus. Mereology was formally axiomatized in the 20th century by Polish logician Stanisław Leśniewski, who introduced it as part of a comprehensive framework for logic and mathematics, and coined the word "mereology". Mereological ideas were influential in early , and formal mereology has continued to be used by a minority in works on the . Different axiomatizations of mereology have been applied in , used in to analyze "mass terms", use ... [...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. Fellow meronyms (naming the various fellow parts of any particular whole) are called comeronyms (for example, ''leaves'', ''branches'', ''trunk'', and ''roots'' are comeronyms under the holonym of ''tree''). 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 hypernym which refers to ''type''. For example, a holonym of ''leaf'' migh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Language
A natural language or ordinary language is a language that occurs naturally in a human community by a process of use, repetition, and change. It can take different forms, typically either a spoken language or a sign language. Natural languages are distinguished from constructed and formal languages such as those used to program computers or to study logic. Defining natural language Natural languages include ones that are associated with linguistic prescriptivism or language regulation. ( Nonstandard dialects can be viewed as a wild type in comparison with standard languages.) An official language with a regulating academy such as Standard French, overseen by the , is classified as a natural language (e.g. in the field of natural language processing), as its prescriptive aspects do not make it constructed enough to be a constructed language or controlled enough to be a controlled natural language. Natural language are different from: * artificial and constructed la ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Web Ontology Language
The Web Ontology Language (OWL) is a family of Knowledge representation and reasoning, knowledge representation languages for authoring Ontology (information science), ontologies. Ontologies are a formal way to describe Taxonomy, 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semantic Web
The Semantic Web, sometimes known as Web 3.0, is an extension of the World Wide Web through standards set by the World Wide Web Consortium (W3C). The goal of the Semantic Web is to make Internet data machine-readable. To enable the encoding of semantics with the data, technologies such as Resource Description Framework (RDF) and Web Ontology Language (OWL) are used. These technologies are used to formally represent metadata. For example, Ontology (information science), ontology can describe concepts, relationships between Entity–relationship model, entities, and categories of things. These embedded semantics offer significant advantages such as reasoning engine, reasoning over data and operating with heterogeneous data sources. These standards promote common data formats and exchange protocols on the Web, fundamentally the RDF. According to the W3C, "The Semantic Web provides a common framework that allows data to be shared and reused across application, enterprise, and commu ... [...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] |
Transitive Relation
In mathematics, a binary relation on a set (mathematics), set is transitive if, for all elements , , in , whenever relates to and to , then also relates to . Every partial order and every equivalence relation is transitive. For example, less than and equality (mathematics), equality among real numbers are both transitive: If and then ; and if and then . 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 is also an ancestor of Carrie. On the other hand, "is the birth mother of" is not a transitive relation, because if Alice is the birth mother of Brenda, and Brenda is the birth mother of Claire, then it does ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
