]> 2008/06/10 OpenCyc Knowledge Base Copyright© 2001-2008 Cycorp, Inc., http://www.cyc.com/, Austin, TX, USA This file contains an OWL representation of information contained in the OpenCyc Knowledge Base. The content of this OWL file is licensed under the Creative Commons Attribution 3.0 license whose text can be found at http://creativecommons.org/licenses/by/3.0/legalcode. The content of this OWL file, including the OpenCyc content it represents, constitutes the "Work" referred to in the Creative Commons license. The terms of this license equally apply to, without limitation, renamings and other logically equivalent reformulations of the content of this OWL file (or portions thereof) in any natural or formal language, as well as to derivations of this content or inclusion of it in other ontologies. externalID A unique, language-neutral, variable-sized identifier for a concept that can be used to refer unambiguously to that concept across OWL exports or across Cyc inference engines. label A natural-language representation for a concept that is both human readable and readable by the Cyc inference engine. These terms are not guaranteed to refer to the same concept across time but are guaranteed to be consistent within a particular OWL export. Use 'cycAnnot:externalID' for unambiguously referring to a concept across OWL exports or across Cyc inference engines. This is the collection of evaluatable functions which are supported by SKSI in the sense that they are translatable to their SQL equivalents. SKSISupportedFunction Mx4rDyAiHB1eQdmcfeGN5UusKw SKSI supported function the union of The Set SKSI supported constant SKSI supported function (CollectionUnionFn (TheSet SKSISupportedConstant SKSISupportedFunction)) This is the collection of evaluatable functions which are supported by SKSI in the sense that they are translatable to their SQL equivalents. SKSISupportedFunction SKSI supported function A collection of collections that is a specialization of <a href="http://sw.opencyc.org/2008/06/10/concept/en/RelationshipType" class="cyc_term">RelationshipType</a>. Each instance of <a href="http://sw.opencyc.org/2008/06/10/concept/en/FunctionType" class="cyc_term">FunctionType</a> is a collection of <a href="http://sw.opencyc.org/2008/06/10/concept/en/Function_Denotational" class="cyc_term">Function_Denotational</a>s. The functions in a given function-category represented in the Knowledge Base are typically those sharing some common feature(s) -- often having to do with what kind of thing the functions return (see <a href="http://sw.opencyc.org/2008/06/10/concept/en/resultIsa" class="cyc_term">resultIsa</a> and <a href="http://sw.opencyc.org/2008/06/10/concept/en/resultGenl" class="cyc_term">resultGenl</a>s) -- considered significant enough that the collection of all such functions is useful to reify. Although what constitutes a &quot;significant common feature&quot; is difficult to specify precisely, there are many clear-cut cases. Examples include <a href="http://sw.opencyc.org/2008/06/10/concept/en/IndividualDenotingFunction" class="cyc_term">IndividualDenotingFunction</a>, <a href="http://sw.opencyc.org/2008/06/10/concept/en/CollectionDenotingFunction" class="cyc_term">CollectionDenotingFunction</a>, and <a href="http://sw.opencyc.org/2008/06/10/concept/en/FunctionDenotingFunction" class="cyc_term">FunctionDenotingFunction</a>. See also <a href="http://sw.opencyc.org/2008/06/10/concept/en/PredicateType" class="cyc_term">PredicateType</a>. FunctionType type of function NonAbducibleCollection non abducible collection The collection <a href="http://sw.opencyc.org/2008/06/10/concept/en/NonAbducibleCollection" class="cyc_term">NonAbducibleCollection</a> is a sub-collection of <a href="http://sw.opencyc.org/2008/06/10/concept/en/SetOrCollection" class="cyc_term">SetOrCollection</a>. Abductive inferences sometimes involve hypothesizing the existence of entities as part of the explanation of some assertion or set of assertions. Cyc will not hypothesize the existence of instances of the collections that are instances of <a href="http://sw.opencyc.org/2008/06/10/concept/en/NonAbducibleCollection" class="cyc_term">NonAbducibleCollection</a>. Roughly, abductive inferences consume conceptual / theoretical knowledge rather than produce it. So, <a href="http://sw.opencyc.org/2008/06/10/concept/en/SecondOrderCollection" class="cyc_term">SecondOrderCollection</a> is an instance of <a href="http://sw.opencyc.org/2008/06/10/concept/en/NonAbducibleCollection" class="cyc_term">NonAbducibleCollection</a> because Cyc should be employing existing theoretical knowledge about instances of <a href="http://sw.opencyc.org/2008/06/10/concept/en/SecondOrderCollection" class="cyc_term">SecondOrderCollection</a> rather than hypothesizing new instances. Function-Denotational A specialization of <a href="http://sw.opencyc.org/2008/06/10/concept/en/Relation" class="cyc_term">Relation</a> (q.v.) and the collection of all functions. Each instance of <a href="http://sw.opencyc.org/2008/06/10/concept/en/Function_Denotational" class="cyc_term">Function_Denotational</a> is a many-one relation that represents, with respect to any given context, a mapping from one set of things (the function's <a href="http://sw.opencyc.org/2008/06/10/concept/en/relationDomain" class="cyc_term">relationDomain</a>) to another set of things (its <a href="http://sw.opencyc.org/2008/06/10/concept/en/relationRange" class="cyc_term">relationRange</a>). As a many-one relation, a function maps each thing in its domain to exactly one thing in its range. A function might be unary, binary, ternary, etc. (see <a href="http://sw.opencyc.org/2008/06/10/concept/en/arity" class="cyc_term">arity</a>; but cf. <a href="http://sw.opencyc.org/2008/06/10/concept/en/relationalArity" class="cyc_term">relationalArity</a>), depending on whether the members of its domain are singletons, ordered pairs, ordered triples, etc. In general, the domain of an N-ary function with respect to a given context is a set of ordered N-tuples (construed in CycL as <a href="http://sw.opencyc.org/2008/06/10/concept/en/List" class="cyc_term">List</a>s of length N). The function is said to take the items from any of these N-tuples as its N <i>arguments</i> and to return a member of its range as its corresponding <i>value</i> (see <a href="http://sw.opencyc.org/2008/06/10/concept/en/valueOfFunctionForArgs" class="cyc_term">valueOfFunctionForArgs</a>). There are also functions that are not of any particular fixed arity; see <a href="http://sw.opencyc.org/2008/06/10/concept/en/VariableArityFunction" class="cyc_term">VariableArityFunction</a>. <p/> For example, <a href="http://sw.opencyc.org/2008/06/10/concept/en/GovernmentFn" class="cyc_term">GovernmentFn</a> is the unary function that takes each <a href="http://sw.opencyc.org/2008/06/10/concept/en/GeopoliticalEntity" class="cyc_term">GeopoliticalEntity</a> to its <a href="http://sw.opencyc.org/2008/06/10/concept/en/RegionalGovernment" class="cyc_term">RegionalGovernment</a>, and <a href="http://sw.opencyc.org/2008/06/10/concept/en/PlusFn" class="cyc_term">PlusFn</a> is the variable-arity function that takes any sequence of two or more <a href="http://sw.opencyc.org/2008/06/10/concept/en/ScalarInterval" class="cyc_term">ScalarInterval</a>s (q.v.) to their arithmetic sum. <p/> Note that the domain and range (i.e. the extension) of a given function might vary from context to context. For example, as the government of a country can change over time, <a href="http://sw.opencyc.org/2008/06/10/concept/en/GovernmentFn" class="cyc_term">GovernmentFn</a> will in such cases map the same country to different governments with respect to different times. Thus, an instance of <a href="http://sw.opencyc.org/2008/06/10/concept/en/Function_Denotational" class="cyc_term">Function_Denotational</a> is closer to what is sometimes called a &quot;function-in-intension&quot; than to the purely set-theoretical notion of a &quot;function-in-extension&quot;. <p/> CycL terms that denote functions can be used to form non-atomic terms (or &quot;NATs&quot;; see <a href="http://sw.opencyc.org/2008/06/10/concept/en/CycLClosedNonAtomicTerm" class="cyc_term">CycLClosedNonAtomicTerm</a>). Specifically, when such a function-denoting expression is appropriately combined with other expressions (i.e. the former is in the 0th argument position and the latter are of the correct number and type) the resulting expression is a new CycL term (a NAT) that may then freely appear as a component in other CycL expressions. The NAT will itself denote the value (if any) of the function denoted by the former expression for the sequence of arguments denoted, respectively, by the latter expressions. For example, <a href="http://sw.opencyc.org/2008/06/10/concept/en/GovernmentFn" class="cyc_term">GovernmentFn</a> is a unary function, and so the CycL constant '<a href="http://sw.opencyc.org/2008/06/10/concept/en/GovernmentFn" class="cyc_term">GovernmentFn</a>' requires one syntactic argument (such as the constant '<a href="http://sw.opencyc.org/2008/06/10/concept/en/France" class="cyc_term">France</a>') to form a NAT (in this case, the expression '(<a href="http://sw.opencyc.org/2008/06/10/concept/en/GovernmentFn" class="cyc_term">GovernmentFn</a> <a href="http://sw.opencyc.org/2008/06/10/concept/en/France" class="cyc_term">France</a>)'). This NAT, which denotes the government of France, can in turn serve as a syntactic argument in any CycL expression in which a term for an instance of <a href="http://sw.opencyc.org/2008/06/10/concept/en/RegionalGovernment" class="cyc_term">RegionalGovernment</a> can legally occur. <p/> Important subcollections of <a href="http://sw.opencyc.org/2008/06/10/concept/en/Function_Denotational" class="cyc_term">Function_Denotational</a> include <a href="http://sw.opencyc.org/2008/06/10/concept/en/IndividualDenotingFunction" class="cyc_term">IndividualDenotingFunction</a> (whose instances always return instances of <a href="http://sw.opencyc.org/2008/06/10/concept/en/Individual" class="cyc_term">Individual</a>), <a href="http://sw.opencyc.org/2008/06/10/concept/en/CollectionDenotingFunction" class="cyc_term">CollectionDenotingFunction</a>, <a href="http://sw.opencyc.org/2008/06/10/concept/en/SetDenotingFunction" class="cyc_term">SetDenotingFunction</a>, and <a href="http://sw.opencyc.org/2008/06/10/concept/en/FunctionDenotingFunction" class="cyc_term">FunctionDenotingFunction</a> (which is itself a subcollection of the first). NATs formed using terms that denote instances of <a href="http://sw.opencyc.org/2008/06/10/concept/en/FunctionDenotingFunction" class="cyc_term">FunctionDenotingFunction</a> denote instances of <a href="http://sw.opencyc.org/2008/06/10/concept/en/Function_Denotational" class="cyc_term">Function_Denotational</a> themselves. Thus, like most other things, functions can be denoted in CycL either by constants (e.g. '<a href="http://sw.opencyc.org/2008/06/10/concept/en/GovernmentFn" class="cyc_term">GovernmentFn</a>') or -- although this is less common -- by NATs (e.g. '(<a href="http://sw.opencyc.org/2008/06/10/concept/en/FunctionToArg" class="cyc_term">FunctionToArg</a> 2 <a href="http://sw.opencyc.org/2008/06/10/concept/en/biologicalMother" class="cyc_term">biologicalMother</a>)'). <p/> An important partition of <a href="http://sw.opencyc.org/2008/06/10/concept/en/Function_Denotational" class="cyc_term">Function_Denotational</a> is into <a href="http://sw.opencyc.org/2008/06/10/concept/en/TotalFunction" class="cyc_term">TotalFunction</a> and <a href="http://sw.opencyc.org/2008/06/10/concept/en/PartialFunction" class="cyc_term">PartialFunction</a> (qq.v.). <p/> Note that <a href="http://sw.opencyc.org/2008/06/10/concept/en/Function_Denotational" class="cyc_term">Function_Denotational</a> does not include any of the so-called <a href="http://sw.opencyc.org/2008/06/10/concept/en/TruthFunction" class="cyc_term">TruthFunction</a>s (q.v.): <a href="http://sw.opencyc.org/2008/06/10/concept/en/Predicate" class="cyc_term">Predicate</a>s, <a href="http://sw.opencyc.org/2008/06/10/concept/en/Quantifier" class="cyc_term">Quantifier</a>s, or <a href="http://sw.opencyc.org/2008/06/10/concept/en/LogicalConnective" class="cyc_term">LogicalConnective</a>s. For these relations (as construed in CycL) are not really functions at all, even though it can be heuristically useful to think of them as if they were functions from sequences of arguments to truth values. function This is the collection of evaluatable functions which are supported by SKSI in the sense that they are translatable to their SQL equivalents. SKSISupportedFunction SKSI supported function This is the collection of evaluatable functions which are supported by SKSI in the sense that they are translatable to their SQL equivalents. SKSISupportedFunction SKSI supported function