Subject |
have domain2 |
have domain1 |
be first domain of |
be second domain of |
documentation |
have inverse |
have axiom |
have arg2 valence |
is a kind of |
is an instance of |
have relatedInternalConcept |
authors | Text | Agent | singleValued | inverse | (authors ?AGENT ?TEXT) means that ?AGENT is creatively responsible for ?TEXT. For example, Agatha Christie is author of 'Murder on the Orient Express' | | (=> (authors ?AGENT ?TEXT) (exists (?PROCESS) (and (agent ?PROCESS ?AGENT) (result ?PROCESS ?TEXT))))
| | | BinaryPredicate | |
beforeEq | TimePoint | TimePoint | singleValued | inverse | (beforeEq ?POINT1 ?POINT2) means that ?POINT1 is identical with ?POINT2 or occurs before it on the universal timeline | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | PartialOrderingRelation | |
birthTime | TimePosition | Organism | singleValued | inverse | A BinaryPredicate that specifies, at any level of resolution, the TimePosition at which a particular Organism was born | | (=> (instance ?ORGANISM Organism) (exists (?TIME1 ?TIME2) (and (birthTime ?ORGANISM ?TIME1) (deathTime ?ORGANISM ?TIME2))))
| | | BinaryPredicate | |
CaseRole | | | singleValued | capability | The Class of Predicates relating the spatially distinguished parts of a Process. CaseRoles include, for example, the agent, patient or destination of an action, the flammable substance in a burning process, or the water that falls in rain | | (=> (and (instance ?ROLE CaseRole) (holds ?ROLE ?ARG1 ?ARG2) (instance ?ARG1 ?PROC)) (capability ?PROC ?ROLE ?ARG2))
| | BinaryPredicate | | |
causes | Process | Process | singleValued | inverse | The causation relation between situations or propositions. (causes ?PROCESS1 ?PROCESS2) means that the state of affairs expressed by ?PROCESS1 brings about the state of affairs expressed by ?PROCESS2 | | (=> (instance ?PROC1 Process) (exists (?PROC2) (causes ?PROC2 ?PROC1)))
| | | BinaryPredicate | |
citizen | Nation | Human | singleValued | inverse | (citizen ?PERSON ?NATION) means that the Human ?PERSON is a citizen of Nation ?NATION | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | BinaryPredicate | |
closedOn | Class | Function | singleValued | inverse | A BinaryFunction is closed on a Class if it is defined for all instances of the Class and its value is always an instance of the Class | | (=> (and (closedOn ?FUNCTION ?CLASS) (instance ?FUNCTION BinaryFunction)) (forall (?INST1 ?INST2) (=> (and (instance ?INST1 ?CLASS) (instance ?INST2 ?CLASS)) (instance (AssignmentFn ?FUNCTION ?INST1 ?INST2) ?CLASS))))
| | | BinaryPredicate | |
connected | Object | Object | valence | subrelation | (connected ?OBJ1 ?OBJ2) means that ?OBJ1 meetsSpatially ?OBJ2 or that ?OBJ1 overlapsSpatially ?OBJ2 | | (=> (crosses ?OBJ1 ?OBJ2) (not (connected ?OBJ1 ?OBJ2)))
| | | SymmetricRelation | |
containsInformation | Proposition | ContentBearingObject | singleValued | inverse | A subrelation of represents. This predicate relates a ContentBearingObject to the Proposition that is expressed by the ContentBearingObject. Examples include the relationships between a physical novel and its story and between a printed score and its musical content | | (=> (subPlan ?PLAN1 ?PLAN2) (forall (?OBJ1 ?OBJ2) (=> (and (containsInformation ?OBJ1 ?PLAN1) (containsInformation ?OBJ2 ?PLAN2)) (subsumesContentInstance ?OBJ2 ?OBJ1))))
| | | BinaryPredicate | |
contraryProperty | Attribute | Attribute | singleValued | inverse | Means that the two arguments are properties that are opposed to one another, e.g. Pliable versus Rigid | | (=> (and (attribute ?OBJ ?ATTR1) (contraryProperty ?ATTR1 ?ATTR2)) (not (attribute ?OBJ ?ATTR2)))
| | | TransitiveRelation | |
cooccur | Physical | Physical | valence | subrelation | (cooccur ?THING1 ?THING2) means that the Object or Process ?THING1 occurs at the same time as, together with, or jointly with the Object or Process ?THING2. This covers the following temporal relations: is co-incident with, is concurrent with, is contemporaneous with, and is concomitant with | | (<=> (cooccur ?PHYS1 ?PHYS2) (equal (WhenFn ?PHYS1) (WhenFn ?PHYS2)))
| | | TemporalRelation | |
copy | Object | Object | singleValued | inverse | relates an Object to an exact copy of the Object, where an exact copy is indistinguishable from the original with regard to every property except (possibly) spatial and/or temporal location | | (=> (copy ?OBJ1 ?OBJ2) (forall (?ATTR) (=> (attribute ?OBJ1 ?ATTR) (attribute ?OBJ2 ?ATTR))))
| | | EquivalenceRelation | |
date | Day | Physical | singleValued | inverse | A BinaryPredicate that specifies a TimePosition in absolute calendar time, at the resolution of one day, for a particular Object or Process | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| singleValued | | BinaryPredicate | |
deathTime | TimePosition | Organism | singleValued | inverse | A BinaryPredicate that specifies, at any level of resolution, the TimePosition at which a particular Organism died | | (=> (instance ?ORGANISM Organism) (exists (?TIME1 ?TIME2) (and (birthTime ?ORGANISM ?TIME1) (deathTime ?ORGANISM ?TIME2))))
| | | BinaryPredicate | |
developmentalForm | Organism | Organism | singleValued | inverse | (developmentalForm ?OBJECT ?FORM) means that ?FORM is an earlier stage in the individual maturation of ?OBJECT. For example, tadpole and caterpillar are developmentalForms of frogs and butterflies, respectively | | (=> (instance ?STRUCT EmbryonicStructure) (exists (?THING) (and (developmentalForm ?THING ?STRUCT) (or (instance ?THING Organism) (instance ?THING AnatomicalStructure)))))
| | | TransitiveRelation | |
disjoint | Class | Class | singleValued | inverse | Classes are disjoint only if they share no instances, i.e. just in case the result of applying IntersectionFn to them is empty | | (=> (instance ?SUPERCLASS PairwiseDisjointClass) (forall (?CLASS1 ?CLASS2) (=> (and (instance ?CLASS1 ?SUPERCLASS) (instance ?CLASS2 ?SUPERCLASS)) (or (equal ?CLASS1 ?CLASS2) (disjoint ?CLASS1 ?CLASS2)))))
| | | SymmetricRelation | |
distributes | BinaryFunction | BinaryFunction | trichotomizingOn | inverse | A BinaryFunction ?FUNCTION1 is distributive over another BinaryFunction ?FUNCTION2 just in case (?FUNCTION1 ?INST1 (?FUNCTION2 ?INST2 ?INST3)) is equal to (?FUNCTION2 (?FUNCTION1 ?INST1 ?INST2) (?FUNCTION1 ?INST1 ?INST3)), for all ?INST1, ?INST2, and ?INST3 | | (=> (distributes ?FUNCTION1 ?FUNCTION2) (forall (?INST1 ?INST2 ?INST3) (=> (and (instance ?INST1 (DomainFn ?FUNCTION1)) (instance ?INST2 (DomainFn ?FUNCTION1)) (instance ?INST3 (DomainFn ?FUNCTION1)) (instance ?INST1 (DomainFn ?FUNCTION2)) (instance ?INST2 (DomainFn ?FUNCTION2)) (instance ?INST3 (DomainFn ?FUNCTION2))) (equal (AssignmentFn ?FUNCTION1 ?INST1 (AssignmentFn ?FUNCTION2 ?INST2 ?INST3)) (AssignmentFn ?FUNCTION2 (AssignmentFn ?FUNCTION1 ?INST1 ?INST2) (AssignmentFn ?FUNCTION1 ?INST1 ?INST3))))))
| | | BinaryRelation | |
documentation | SymbolicString | Entity | singleValued | inverse | A relation between objects in the domain of discourse and strings of natural language text. The domain of documentation is not constants (names), but the objects themselves. This means that one does not quote the names when associating them with their documentation | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | BinaryPredicate | |
duration | TimeDuration | TimePosition | singleValued | inverse | (duration ?POS ?TIME) means that the duration of the TimePosition ?POS is ?TIME. Note that this Predicate can be used in conjunction with the Function WhenFn to specify the duration of any instance of Physical | | (=> (instance ?YEAR Year) (duration ?YEAR YearDuration))
| | | BinaryPredicate | |
earlier | TimeInterval | TimeInterval | valence | subrelation | (earlier INTERVAL1 INTERVAL2) means that INTERVAL1 ends before INTERVAL2 begins | | (=> (earlier ?INTERVAL1 ?INTERVAL2) (before (EndFn ?INTERVAL1) (BeginFn ?INTERVAL2)))
| | | TransitiveRelation | |
element | Set | Entity | singleValued | inverse | (element ?ENTITY ?SET) is true just in case ?ENTITY is contained in the Set ?SET. An Entity can be an element of another Entity only if the latter is a Set | | (=> (forall (?ELEMENT) (<=> (element ?ELEMENT ?SET1) (element ?ELEMENT ?SET2))) (equal ?SET1 ?SET2))
| | | IntransitiveRelation | |
equal | Entity | Entity | valence | subrelation | (equal ?ENTITY1 ?ENTITY2) is true just in case ?ENTITY1 is identical with ?ENTITY2 | | (=> (and (instance ?REL RelationExtendedToQuantities) (instance ?REL BinaryRelation) (instance ?NUMBER1 RealNumber) (instance ?NUMBER2 RealNumber) (holds ?REL ?NUMBER1 ?NUMBER2)) (forall (?UNIT) (=> (instance ?UNIT UnitOfMeasure) (holds ?REL (MeasureFn ?NUMBER1 ?UNIT) (MeasureFn ?NUMBER2 ?UNIT)))))
| | | RelationExtendedToQuantities | |
equivalenceRelationOn | Class | BinaryRelation | singleValued | inverse | A BinaryRelation is an equivalenceRelationOn a Class only if the relation is reflexiveOn the Class and it is both a TransitiveRelation and a SymmetricRelation | | (=> (equivalenceRelationOn ?RELATION ?CLASS) (and (instance ?RELATION TransitiveRelation) (instance ?RELATION SymmetricRelation) (reflexiveOn ?RELATION ?CLASS)))
| | | BinaryPredicate | |
existant | TimePosition | Physical | valence | subrelation | This relation holds between an instance of Physical and an instance of TimePosition just in case the temporal lifespan of the former includes the latter. The constants located and existant are the basic spatial and temporal predicates, respectively | | (=> (result ?PROC ?OBJ) (forall (?TIME) (=> (before ?TIME (BeginFn (WhenFn ?PROC))) (not (existant ?OBJ ?TIME)))))
| | | TemporalRelation | |
exploits | Agent | Object | singleValued | inverse | (exploits ?OBJ ?AGENT) means that ?OBJ is used by ?AGENT as a resource in an unspecified instance of Process. This Predicate, as its corresponding axiom indicates, is a composition of the relations agent and resource | | (=> (exploits ?OBJ ?AGENT) (exists (?PROCESS) (and (agent ?PROCESS ?AGENT) (resource ?PROCESS ?OBJ))))
| | | BinaryPredicate | |
familyRelation | Organism | Organism | singleValued | inverse | A very general Predicate for biological relationships. (familyRelation ?ORGANISM1 ?ORGANISM2) means that ?ORGANISM1 and ?ORGANISM2 are biologically derived from a common ancestor | | (=> (instance ?GROUP FamilyGroup) (forall (?MEMB1 ?MEMB2) (=> (and (member ?MEMB1 ?GROUP) (member ?MEMB2 ?GROUP)) (familyRelation ?MEMB1 ?MEMB2))))
| | | EquivalenceRelation | |
fills | Hole | Object | valence | subrelation | Holes can be filled. (fills ?OBJ ?HOLE) means that the Object ?OBJ fills the Hole ?HOLE. Note that fills here means perfectly filled | | (=> (holdsDuring ?TIME (fills ?OBJ ?HOLE)) (attribute ?HOLE Fillable))
| | | SpatialRelation | Fillable |
finishes | TimeInterval | TimeInterval | valence | subrelation | (finishes ?INTERVAL1 ?INTERVAL2) means that ?INTERVAL1 and ?INTERVAL2 are both TimeIntervals that have the same ending TimePoint and that ?INTERVAL2 begins before ?INTERVAL1 | | (=> (instance ?REL TransitiveRelation) (forall (?INST1 ?INST2 ?INST3) (=> (and (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST3)) (holds ?REL ?INST1 ?INST3))))
| | | TransitiveRelation | |
frequency | TimeDuration | Process | singleValued | inverse | (frequency ?PROC ?TIME) means that the Process type of ?PROC recurs after every interval of ?TIME | | (=> (frequency ?PROC ?TIME1) (forall (?TIME2) (=> (duration ?TIME2 ?TIME1) (exists (?POINT) (and (temporalPart ?POINT ?TIME2) (holdsDuring ?POINT (exists (?INST) (instance ?INST ?PROC))))))))
| | | BinaryPredicate | |
greaterThan | Quantity | Quantity | valence | subrelation | (greaterThan ?NUMBER1 ?NUMBER2) is true just in case the Quantity ?NUMBER1 is greater than the Quantity ?NUMBER2 | lessThan | (=> (larger ?OBJ1 ?OBJ2) (forall (?QUANT1 ?QUANT2) (=> (and (measure ?OBJ1 (MeasureFn ?QUANT1 LengthMeasure)) (measure ?OBJ2 (MeasureFn ?QUANT2 LengthMeasure))) (greaterThan ?QUANT1 ?QUANT2))))
| | | TransitiveRelation | |
greaterThanOrEqualTo | Quantity | Quantity | valence | subrelation | (greaterThanOrEqualTo ?NUMBER1 ?NUMBER2) is true just in case the Quantity ?NUMBER1 is greater than the Quantity ?NUMBER2 | lessThanOrEqualTo | (=> (instance ?NUMBER NonnegativeRealNumber) (greaterThanOrEqualTo ?NUMBER 0))
| | | RelationExtendedToQuantities | |
hasPurpose | Formula | Physical | singleValued | inverse | This Predicate expresses the concept of a conventional goal, i.e. a goal with a neutralized agent's intention. Accordingly, (hasPurpose ?THING ?FORMULA) means that the instance of Physical ?THING has, as its purpose, the Proposition expressed by ?FORMULA. Note that there is an important difference in meaning between the Predicates hasPurpose and result. Although the second argument of the latter can satisfy the second argument of the former, a conventional goal is an expected and desired outcome, while a result may be neither expected nor desired. For example, a machine process may have outcomes but no goals, aimless wandering may have an outcome but no goal; a learning process may have goals with no outcomes, and so on | | (=> (instance ?ORGAN Organ) (exists (?PURP) (hasPurpose ?ORGAN ?PURP)))
| | | BinaryPredicate | |
hasSkill | Agent | Process | singleValued | inverse | Similar to the capability Predicate with the additional restriction that the ability be practised/ demonstrated to some measurable degree | | (=> (hasSkill ?PROC ?AGENT) (capability ?PROC agent ?AGENT))
| | | BinaryPredicate | |
holdsDuring | Formula | TimePosition | singleValued | inverse | (holdsDuring ?TIME ?FORMULA) means that the proposition denoted by ?FORMULA is true in the time frame ?TIME. Note that this implies that ?FORMULA is true at every TimePoint which is a temporalPart of ?TIME | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | BinaryPredicate | |
holdsObligation | Agent | Process | singleValued | inverse | Expresses a relationship between a subclass of Process and an Agent whereby the Agent has the obligation to perform exactly one instance of the Process type specified, i.e. to be an agent of just one instance of the Process type | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | BinaryPredicate | holdsRight |
holdsRight | Agent | Process | singleValued | inverse | Expresses a relationship between a subclass of Process and an Agent whereby the Agent has the right to perform at least one instance of the Process type specified, i.e. to be an agent of at least one instance of the Process type | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | BinaryPredicate | |
hole | Object | Hole | valence | subrelation | (hole ?HOLE ?OBJ) means that ?HOLE is a Hole in ?OBJ. A Hole is an fillable body located at the surface an Object | | (=> (equal ?OBJ1 (PrincipalHostFn ?HOLE)) (forall (?OBJ2) (<=> (overlapsSpatially ?OBJ2 ?OBJ1) (exists (?OBJ3) (and (hole ?HOLE ?OBJ3) (instance ?OBJ3 SelfConnectedObject) (overlapsSpatially ?OBJ2 ?OBJ3))))))
| | | SpatialRelation | |
identityElement | Entity | BinaryFunction | singleValued | inverse | An object ?ID is the identity element for BinaryFunction ?FUNCTION just in case, for every instance ?INST, applying ?FUNCTION to ?INST and ?ID results in ?INST | | (=> (identityElement ?FUNCTION ?ID) (forall (?INST) (=> (instance ?INST (DomainFn ?FUNCTION)) (equal (AssignmentFn ?FUNCTION ?ID ?INST) ?INST))))
| | | BinaryPredicate | |
inhabits | Object | Organism | singleValued | inverse | A very basic notion of living within something else. (inhabits ?ORGANISM ?OBJECT) means that ?OBJECT is the residence, nest, home, etc. of ?ORGANISM | | (=> (instance ?FISH Fish) (exists (?WATER) (and (inhabits ?FISH ?WATER) (instance ?WATER Water))))
| | | BinaryPredicate | |
inhibits | Process | Process | singleValued | inverse | A very general Predicate. (inhibits ?PROC1 ?PROC2) means that the Process ?PROC1 inhibits or hinders the occurrence of the Process ?PROC2. For example, obstructing an object inhibits moving it. Note that this is a relation between types of Processes, not between instances | | (=> (instance ?REL IrreflexiveRelation) (forall (?INST) (not (holds ?REL ?INST ?INST))))
| | | IrreflexiveRelation | |
inScopeOfInterest | Entity | Agent | singleValued | inverse | A very general Predicate. (inScopeOfInterest ?AGENT ?ENTITY) means that ?ENTITY is within the scope of interest of ?AGENT. Note that the interest indicated can be either positive or negative, i.e. the ?AGENT can have an interest in avoiding or promoting ?ENTITY | | (=> (and (instance ?SEARCH Searching) (agent ?SEARCH ?AGENT) (patient ?SEARCH ?ENTITY)) (inScopeOfInterest ?AGENT ?ENTITY))
| | | IntentionalRelation | |
instance | Class | Entity | singleValued | inverse | An object is an instance a Class if it is a member of that Class. An individual may be an instance of many classes, some of which may be subclasses of others. Thus, there is no assumption in the meaning of instance about specificity or uniqueness | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | BinaryPredicate | |
inverse | BinaryRelation | BinaryRelation | singleValued | inverse | The inverse of a BinaryRelation is a relation in which all the tuples of the original relation are reversed. In other words, one BinaryRelation is the inverse of another if they are equivalent when their arguments are swapped | | (=> (and (inverse ?REL1 ?REL2) (instance ?REL1 BinaryRelation) (instance ?REL2 BinaryRelation)) (forall (?INST1 ?INST2) (<=> (holds ?REL1 ?INST1 ?INST2) (holds ?REL2 ?INST2 ?INST1))))
| | | SymmetricRelation | |
irreflexiveOn | Class | BinaryRelation | singleValued | inverse | A BinaryRelation is irreflexive on a Class only if no instance of the Class bears the relation to itself | | (=> (irreflexiveOn ?RELATION ?CLASS) (forall (?INST) (=> (instance ?INST ?CLASS) (not (holds ?RELATION ?INST ?INST)))))
| | | BinaryPredicate | |
larger | Object | Object | valence | subrelation | (larger ?OBJ1 ?OBJ2) simply means that ?OBJ1 is larger, with respect to all LengthMeasures, than ?OBJ2 | | (=> (larger ?OBJ1 ?OBJ2) (forall (?QUANT1 ?QUANT2) (=> (and (measure ?OBJ1 (MeasureFn ?QUANT1 LengthMeasure)) (measure ?OBJ2 (MeasureFn ?QUANT2 LengthMeasure))) (greaterThan ?QUANT1 ?QUANT2))))
| | | TransitiveRelation | |
lessThan | Quantity | Quantity | valence | subrelation | (lessThan ?NUMBER1 ?NUMBER2) is true just in case the Quantity ?NUMBER1 is less than the Quantity ?NUMBER2 | | (=> (instance ?NUMBER NegativeRealNumber) (lessThan ?NUMBER 0))
| | | TransitiveRelation | |
lessThanOrEqualTo | Quantity | Quantity | valence | subrelation | (lessThanOrEqualTo ?NUMBER1 ?NUMBER2) is true just in case the Quantity ?NUMBER1 is less than or equal to the Quantity ?NUMBER2 | | (=> (instance (MonthFn ?NUMBER ?YEAR) Month) (lessThanOrEqualTo ?NUMBER 12))
| | | RelationExtendedToQuantities | |
measure | ConstantQuantity | Object | singleValued | inverse | A very general Predicate for asserting that a particular Object is measured by a particular ConstantQuantity. In general, the second argument of this Predicate will be an instance of the Function MeasureFn | | (=> (larger ?OBJ1 ?OBJ2) (forall (?QUANT1 ?QUANT2) (=> (and (measure ?OBJ1 (MeasureFn ?QUANT1 LengthMeasure)) (measure ?OBJ2 (MeasureFn ?QUANT2 LengthMeasure))) (greaterThan ?QUANT1 ?QUANT2))))
| | | BinaryPredicate | |
meetsTemporally | TimeInterval | TimeInterval | valence | subrelation | (meetsTemporally ?INTERVAL1 ?INTERVAL2) means that the terminal point of the TimeInterval ?INTERVAL1 is the initial point of the TimeInterval ?INTERVAL2 | | (=> (instance ?REL IntransitiveRelation) (forall (?INST1 ?INST2 ?INST3) (=> (and (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST3)) (not (holds ?REL ?INST1 ?INST3)))))
| | | TemporalRelation | |
member | Collection | SelfConnectedObject | valence | subrelation | A specialized common sense notion of part for uniform parts of Collections. For example, each sheep in a flock of sheep would have the relationship of member to the flock | | (=> (instance ?COLL Collection) (exists (?OBJ) (member ?OBJ ?COLL)))
| | | SpatialRelation | instance |
overlapsTemporally | TimeInterval | TimeInterval | valence | subrelation | (overlapsTemporally ?INTERVAL1 ?INTERVAL2) means that the two TimeIntervals ?INTERVAL1 and ?INTERVAL2 have a TimeInterval in common. Note that this is consistent with ?INTERVAL1 and ?INTERVAL2 being the same TimeInterval | | (=> (and (time ?PHYS ?TIME1) (time ?PHYS ?TIME2)) (or (overlapsTemporally ?TIME1 ?TIME2) (temporalPart ?TIME1 ?TIME2) (temporalPart ?TIME2 ?TIME1)))
| | | TemporalRelation | |
parent | Organism | Organism | singleValued | inverse | The general relationship of parenthood. (parent ?PARENT ?CHILD) means that ?PARENT is a biological parent of ?CHILD | | (=> (parent ?PARENT ?CHILD) (or (mother ?PARENT ?CHILD) (father ?PARENT ?CHILD)))
| | | IntransitiveRelation | |
part | SelfConnectedObject | SelfConnectedObject | valence | subrelation | The basic mereological relation. All other mereological relations are defined in terms of this one. (part ?PART ?WHOLE) simply means that the Object ?PART is part of the Object ?WHOLE. Note that, since part is a ReflexiveRelation, every Object is a part of itself | | (=> (overlapsPartially ?OBJ1 ?OBJ2) (and (not (part ?OBJ1 ?OBJ2)) (not (part ?OBJ2 ?OBJ1))))
| | | SpatialRelation | |
partiallyFills | Hole | Object | valence | subrelation | (partiallyFills ?OBJ ?HOLE) means that there is an Object ?OBJ that completelyFills some part of ?HOLE. Note that if (partiallyFills ?OBJ1 ?HOLE) and (part ?OBJ1 ?OBJ2), then (partiallyFills ?OBJ2 ?HOLE). Note too that a partial filler need not be wholly inside a hole (it may stick out), which means that every complete filler also qualifies as (is a limit case of) a partial one | | (=> (partiallyFills ?OBJ ?HOLE1) (exists (?HOLE2) (and (part ?HOLE2 ?HOLE1) (completelyFills ?OBJ ?HOLE2))))
| | | SpatialRelation | |
partialOrderingOn | Class | BinaryRelation | singleValued | inverse | A BinaryRelation is a partial ordering on a Class only if the relation is reflexiveOn the Class, and it is both an AntisymmetricRelation, and a TransitiveRelation | | (=> (partialOrderingOn ?RELATION ?CLASS) (and (reflexiveOn ?RELATION ?CLASS) (instance ?RELATION TransitiveRelation) (instance ?RELATION AntisymmetricRelation)))
| | | BinaryPredicate | |
partlyLocated | Region | Object | valence | subrelation | The predicate of partial localization. For example, Istanbul is partly located in Asia. Note that this is the most basic localization relation: located and exactlyLocated are both subrelations of partlyLocated | | (=> (partlyLocated ?OBJ ?REGION) (overlapsSpatially ?OBJ ?REGION))
| | | SpatialRelation | |
position | Object | Object | valence | subrelation | (position ?OBJ1 ?OBJ2) means that ?OBJ1 is positioned with respect to ?OBJ2 in some way. This is a very general predicate whose main function is to serve as an umbrella for specific Predicates | | (=> (and (instance ?REL SpatialRelation) (holds ?REL ?OBJ1 ?OBJ2)) (overlapsTemporally (WhenFn ?OBJ1) (WhenFn ?OBJ2)))
| | | SpatialRelation | |
possesses | Object | Agent | singleValued | inverse | Relation that holds between an Agent and an Object when the Agent has ownership of the Object | | (=> (possesses ?PERSON ?OBJ) (exists (?TYPE) (and (holdsRight ?PERSON ?TYPE) (forall (?PROCESS) (=> (instance ?PROCESS ?TYPE) (patient ?PROCESS ?OBJ))))))
| | | BinaryPredicate | |
precondition | Process | Process | singleValued | inverse | A very general Predicate. (precondition ?PROC1 ?PROC2) means that ?PROC2 can exist or be true only if ?PROC1 exists or is true. At some point, this Predicate should probably be broken up into more specific Predicates with more restrictive domain restrictions | | (=> (instance ?REL TransitiveRelation) (forall (?INST1 ?INST2 ?INST3) (=> (and (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST3)) (holds ?REL ?INST1 ?INST3))))
| | | TransitiveRelation | |
prevents | Process | Process | singleValued | inverse | A very general Predicate. (prevents ?PROC1 ?PROC2) means that ?PROC1 prevents the occurrence of ?PROC2. In other words, if ?PROC1 is occurring in a particular time and place, ?PROC2 cannot occur at the same time and place. For example, innoculating prevents contracting disease. Note that this is a relation between types of Processes, not between instances | | (=> (instance ?REL IrreflexiveRelation) (forall (?INST) (not (holds ?REL ?INST ?INST))))
| | | IrreflexiveRelation | |
properlyFills | Hole | Object | valence | subrelation | (properlyFills ?OBJ ?HOLE) means that ?HOLE is properly (though perhaps incompletely) filled by ?OBJ, i.e. some part of ?HOLE is perfectly filled by ?OBJ. Note that properlyFills is the dual of completelyFills, and is so related to partiallyFills that ?OBJ properlyFills ?HOLE just in case ?OBJ partiallyFills every part of ?HOLE. (Thus, every perfect filler is both complete and proper in this sense) | | (=> (properlyFills ?OBJ ?HOLE1) (exists (?HOLE2) (and (part ?HOLE2 ?HOLE1) (fills ?OBJ ?HOLE2))))
| | | SpatialRelation | |
property | Attribute | Physical | singleValued | inverse | This Predicate holds between an instance of Physical and an instance of Attribute. (property ?THING ?ATTR) means that ?THING has the Attribute ?ATTR. The two subrelations of property are attribute and manner | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | BinaryPredicate | |
range | Class | Function | singleValued | inverse | Gives the range of a function. In other words, (range ?FUNCTION ?CLASS) means that all of the values assigned by ?FUNCTION are instances of ?CLASS | | (=> (instance ?FUNCTION UnaryConstantFunctionQuantity) (and (domain ?FUNCTION 1 ConstantQuantity) (range ?FUNCTION ConstantQuantity)))
| | | BinaryPredicate | |
rangeSubclass | Class | Function | singleValued | inverse | (rangeSubclass ?FUNCTION ?CLASS) means that all of the values assigned by ?FUNCTION are subclasses of ?CLASS | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | BinaryPredicate | |
refers | Entity | Physical | singleValued | inverse | (refers ?OBJ1 ?OBJ2) means that ?OBJ1 mentions or includes a reference to ?OBJ2. Note that refers is more general in meaning than represents, because presumably something can represent something else only if it refers to this other thing. For example, an article whose topic is a recent change in the price of oil may refer to many other things, e.g. the general state of the economy, the weather in California, the prospect of global warming, the options for alternative energy sources, the stock prices of various oil companies, etc | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | BinaryPredicate | |
reflexiveOn | Class | BinaryRelation | singleValued | inverse | A BinaryRelation is reflexive on a Class only if every instance of the Class bears the relation to itself | | (=> (equivalenceRelationOn ?RELATION ?CLASS) (and (instance ?RELATION TransitiveRelation) (instance ?RELATION SymmetricRelation) (reflexiveOn ?RELATION ?CLASS)))
| | | BinaryPredicate | |
relatedInternalConcept | Entity | Entity | singleValued | inverse | Means that the two arguments are related concepts within the SUMO, i.e. there is a significant similarity of meaning between them. To indicate a meaning relation between a SUMO concept and a concept from another source, use the Predicate relatedExternalConcept | | (=> (instance ?REL BinaryPredicate) (valence ?REL 2))
| | | EquivalenceRelation | |
represents | Entity | Physical | singleValued | inverse | A very general semiotics Predicate. (represents ?THING ?ENTITY) means that ?THING in some way expresses, connotes, pictures, describes, etc. ?ENTITY. The Predicates containsInformation and realization are subrelations of represents. Note that represents is a subrelation of refers, since something can represent something else only if it refers to this other thing | | (=> (represents ?REP ?ENTITY) (exists (?LANGUAGE) (representsInLanguage ?REP ?ENTITY ?LANGUAGE)))
| | | BinaryPredicate | |
sentenceOfLanguage | Language | Sentence | singleValued | inverse | (sentenceOfLanguage ?SENT ?LANG) means that ?SENT is a Sentence of the Language ?LANG | | (<=> (sentenceOfLanguage ?SENT ?LANGUAGE) (exists (?PROP) (representsInLanguage ?SENT ?PROP ?LANGUAGE)))
| | | BinaryPredicate | |
singleValued | Integer | Predicate | singleValued | inverse | (singleValued ?REL ?INT) means that the argument position of ?REL corresponding to ?INT is single-valued, i.e. an assignment of values to the other argument positions determines a unique value for the argument position corresponding to ?INT | | (=> (and (singleValued ?PRED 3) (holds ?PRED ?INST1 ?INST2 ?INST3) (holds ?PRED ?INST1 ?INST2 ?INST4)) (equal ?INST3 ?INST4))
| | | BinaryPredicate | |
smaller | Object | Object | valence | subrelation | (smaller ?OBJ1 ?OBJ2) simply means that ?OBJ1 is smaller, with respect to all LengthMeasures, than ?OBJ2 | larger | (=> (instance ?REL TransitiveRelation) (forall (?INST1 ?INST2 ?INST3) (=> (and (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST3)) (holds ?REL ?INST1 ?INST3))))
| | | TransitiveRelation | |
starts | TimeInterval | TimeInterval | valence | subrelation | (starts ?INTERVAL1 ?INTERVAL2) means that ?INTERVAL1 and ?INTERVAL2 are both TimeIntervals that have the same initial TimePoint and that ?INTERVAL1 ends before ?INTERVAL2 | | (=> (instance ?REL TransitiveRelation) (forall (?INST1 ?INST2 ?INST3) (=> (and (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST3)) (holds ?REL ?INST1 ?INST3))))
| | | TransitiveRelation | |
subAttribute | Attribute | Attribute | singleValued | inverse | Means that the second argument can be ascribed to everything which has the first argument ascribed to it | | (<=> (subAttribute ?ATTR1 ?ATTR2) (forall (?OBJ) (=> (attribute ?OBJ ?ATTR1) (attribute ?OBJ ?ATTR2))))
| | | PartialOrderingRelation | |
subclass | Class | Class | singleValued | inverse | Class C is a subclass of Class P only if every instance of C is also an instance of P. A class may have multiple superclasses and subclasses | | (=> (instance ?OBJ CorpuscularObject) (exists (?SUBSTANCETYPE1 ?SUBSTANCETYPE2 ?SUBSTANCE1 ?SUBSTANCE2) (and (subclass ?SUBSTANCETYPE1 Substance) (subclass ?SUBSTANCETYPE2 Substance) (instance ?SUBSTANCE1 ?SUBSTANCETYPE1) (instance ?SUBSTANCE2 ?SUBSTANCETYPE2) (material ?SUBSTANCE1 ?OBJ) (material ?SUBSTANCE2 ?OBJ) (not (equal ?SUBSTANCE1 ?SUBSTANCE2)))))
| | | PartialOrderingRelation | |
subCollection | Collection | Collection | singleValued | inverse | (subCollection ?COLL1 ?COLL2) means that the Collection ?COLL1 is a proper part of the Collection ?COLL2 | | (=> (instance ?REL TransitiveRelation) (forall (?INST1 ?INST2 ?INST3) (=> (and (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST3)) (holds ?REL ?INST1 ?INST3))))
| | | TransitiveRelation | |
subPlan | Plan | Plan | singleValued | inverse | (subPlan ?PLAN1 ?PLAN2) means that ?PLAN1 is a Plan which is a proper part of ?PLAN2. This relation is generally used to relate a supporting Plan to the overall Plan in a particular context | | (=> (subPlan ?PLAN1 ?PLAN2) (forall (?OBJ1 ?OBJ2) (=> (and (containsInformation ?OBJ1 ?PLAN1) (containsInformation ?OBJ2 ?PLAN2)) (subsumesContentInstance ?OBJ2 ?OBJ1))))
| | | TransitiveRelation | |
subProcess | Process | Process | singleValued | inverse | (subProcess ?SUBPROC ?PROC) means that ?SUBPROC is a subprocess of ?PROC. A subprocess is here understood as a temporally distinguished part (proper or not) of a Process | | (=> (subProcess ?SUBPROC ?PROC) (forall (?REGION) (=> (located ?PROC ?REGION) (located ?SUBPROC ?REGION))))
| | | PartialOrderingRelation | |
subrelation | Relation | Relation | singleValued | inverse | A Relation R is a subrelation Relation R' if R is a subclass R'. This implies that every tuple of R is also a tuple of R'. Again, if R holds for some arguments arg_1, arg_2, ... arg_n, then R' holds for the same arguments. Thus, a Relation and its subrelation must have the same valence. In CycL, subrelation is called #$genlPreds | | (=> (subrelation ?PRED1 ?PRED2) (exists (?NUMBER) (and (valence ?PRED1 ?NUMBER) (valence ?PRED2 ?NUMBER))))
| | | PartialOrderingRelation | |
subsumesContentClass | ContentBearingObject | ContentBearingObject | singleValued | inverse | A BinaryPredicate that relates two subclasses of ContentBearingObject. (subsumesContentClass ?CLASS1 ?CLASS2) means that the content expressed by each instance of ?CLASS1 is also expressed by each instance of ?CLASS2. Examples include the relationship between a poem and one of its stanzas or between a book and one of its chapters. Note that this is a relation between subclasses of ContentBearingObject, rather than instances. If one wants to relate instances, the Predicate subsumesContentInstance can be used. Note that subsumesContentClass is needed in many cases. Consider, for example, the relation between the King James edition of the Bible and its Book of Genesis. This relation holds for every copy of this edition and not just for a single instance | | (<=> (subsumesContentClass ?CLASS1 ?CLASS2) (forall (?INFO ?OBJ1 ?OBJ2) (=> (and (instance ?OBJ1 ?CLASS1) (instance ?OBJ2 ?CLASS2) (containsInformation ?OBJ1 ?INFO)) (containsInformation ?OBJ2 ?INFO))))
| | | PartialOrderingRelation | |
subsumesContentInstance | ContentBearingObject | ContentBearingObject | singleValued | inverse | A BinaryPredicate relating two instances of ContentBearingObject. (subsumesContentInstance ?OBJ1 ?OBJ2) means that the content expressed by ?OBJ2 is part of the content expressed by ?OBJ1. An example is the relationship between a handwritten poem and one of its stanzas. Note that this is a relation between instances, rather than Classes. If one wants to assert a content relationship between Classes, e.g. between the version of an intellectual work and a part of that work, the relation subsumesContentClass should be used | | (=> (subPlan ?PLAN1 ?PLAN2) (forall (?OBJ1 ?OBJ2) (=> (and (containsInformation ?OBJ1 ?PLAN1) (containsInformation ?OBJ2 ?PLAN2)) (subsumesContentInstance ?OBJ2 ?OBJ1))))
| | | PartialOrderingRelation | subsumesContentClass |
successorAttribute | Attribute | Attribute | singleValued | inverse | (successorAttribute ?ATTR1 ?ATTR2) means that ?ATTR2 is the attribute that comes immediately after ?ATTR1 on the scale that they share | | (=> (successorAttribute ?ATTR1 ?ATTR2) (successorAttributeClosure ?ATTR1 ?ATTR2))
| | | BinaryPredicate | |
successorAttributeClosure | Attribute | Attribute | singleValued | inverse | The transitive closure of successorAttribute. (successorAttributeClosure ?ATTR1 ?ATTR2) means that there is a chain of successorAttribute assertions connecting ?ATTR1 and ?ATTR2 | | (=> (successorAttribute ?ATTR1 ?ATTR2) (successorAttributeClosure ?ATTR1 ?ATTR2))
| | | TransitiveRelation | successorAttribute |
temporalPart | TimeInterval | TimePoint | singleValued | inverse | (temporalPart ?POINT ?INTERVAL) means that TimePoint ?POINT is part of TimeInterval ?INTERVAL | | (=> (instance ?POINT TimePoint) (exists (?INTERVAL) (and (instance ?INTERVAL TimeInterval) (temporalPart ?POINT ?INTERVAL))))
| | | BinaryPredicate | |
time | TimePosition | Physical | valence | subrelation | A very general TemporalRelation that specifies, at any level of resolution, the TimePosition at which a particular Object or Process exists or occurs | | (=> (and (time ?PHYS ?TIME1) (time ?PHYS ?TIME2)) (or (overlapsTemporally ?TIME1 ?TIME2) (temporalPart ?TIME1 ?TIME2) (temporalPart ?TIME2 ?TIME1)))
| | | TemporalRelation | |
totalOrderingOn | Class | BinaryRelation | singleValued | inverse | A BinaryRelation ?REL is a total ordering on a Class only if it is a partial ordering for which either (?REL ?INST1 ?INST2) or (?REL ?INST2 ?INST1) for every ?INST1 and ?INST2 in the Class | | (<=> (totalOrderingOn ?RELATION ?CLASS) (and (partialOrderingOn ?RELATION ?CLASS) (trichotomizingOn ?RELATION ?CLASS)))
| | | BinaryPredicate | |
trichotomizingOn | Class | BinaryRelation | singleValued | inverse | A BinaryRelation ?REL is trichotomizing on a Class only if, for all instances ?INST1 and ?INST2 of the Class, at least one of the following holds: (?REL ?INST1 ?INST2), (?REL ?INST2 ?INST1) or (equal ?INST1 ?INST2) | | (=> (trichotomizingOn ?RELATION ?CLASS) (forall (?INST1 ?INST2) (=> (and (instance ?INST1 ?CLASS) (instance ?INST2 ?CLASS)) (or (holds ?RELATION ?INST1 ?INST2) (holds ?RELATION ?INST2 ?INST1) (equal ?INST1 ?INST2)))))
| | | BinaryPredicate | |
uses | Agent | Object | singleValued | inverse | (uses ?OBJECT AGENT) means that ?OBJECT is used by ?AGENT as an instrument in an unspecified Process. This Predicate, as its corresponding axiom indicates, is a composition of the CaseRoles agent and instrument | | (=> (uses ?OBJ ?AGENT) (exists (?PROC) (and (agent ?PROC ?AGENT) (instrument ?PROC ?OBJ))))
| | | BinaryPredicate | |
valence | PositiveInteger | Relation | singleValued | inverse | Specifies the number of arguments that a relation can take. If a relation does not have a fixed number of arguments, it does not have a valence and it is an instance of VariableArityRelation. For example, holds is a VariableArityRelation | | (=> (instance ?REL TernaryPredicate) (valence ?REL 3))
| singleValued | | BinaryPredicate | |
version | Artifact | Artifact | singleValued | inverse | Some Artifacts have a life cycle with discrete stages or versions. (version ARTIFACT1 ARTIFACT2) means that ARTIFACT1 is a version of ARTIFACT2. Note that this Predicate relates subclasses of Artifact and not instances | | (=> (version ?ARTIFACT1 ?ARTIFACT2) (subclass ?ARTIFACT1 ?ARTIFACT2))
| | | TransitiveRelation | |