| 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 |
|---|
| above | | | trichotomizingOn | inverse | This is a cognitive primitive, derived from the up/down schema and not involving contact. (above ?OBJ1 ?OBJ2) means that ?OBJ1 is above ?OBJ2 | below | (=>
(under ?OBJ1 ?OBJ2)
(or
(on ?OBJ2 ?OBJ1)
(above ?OBJ2 ?OBJ1)))
| | | TransitiveRelation | |
| 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 | |
| behind | | | trichotomizingOn | inverse | This is a cognitive primitive, derived from the front/back schema. (behind ?OBJ1 ?OBJ2) means that ?OBJ1 is behind ?OBJ2 | | (=>
(instance ?REL TransitiveRelation)
(forall (?INST1 ?INST2 ?INST3)
(=>
(and
(holds ?REL ?INST1 ?INST2)
(holds ?REL ?INST2 ?INST3))
(holds ?REL ?INST1 ?INST3))))
| | | TransitiveRelation | |
| below | | | trichotomizingOn | inverse | This is a cognitive primitive, derived from the up/down schema and not involving contact. (below ?OBJ1 ?OBJ2) means that ?OBJ1 is below ?OBJ2 | | (=>
(below ?OBJ1 ?OBJ2)
(not
(connected ?OBJ1 ?OBJ2)))
| | | TransitiveRelation | |
| 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 | |
| CardinalityFn | NonnegativeInteger | (UnionFn Class Collection) | rangeSubclass | inverse | (CardinalityFn ?CLASS) returns the number of instances in the Class or Collection ?CLASS | | (=>
(instance ?SET FiniteSet)
(exists (?NUMBER)
(and
(instance ?NUMBER NonnegativeInteger)
(equal ?NUMBER (CardinalityFn ?SET)))))
| | | UnaryFunction | |
| 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 | |
| contains | | | trichotomizingOn | inverse | Limits, bounds, confines, encloses or circumscribes - the surrounding relation for Objects. (contains ?OBJ1 ?OBJ2) means that the interior of ?OBJ1 wholly surrounds ?OBJ2 | | (=>
(contains ?OBJ1 ?OBJ2)
(forall (?PART2)
(=>
(part ?PART2 ?OBJ2)
(exists (?PART1)
(and
(interiorPart ?PART1 ?OBJ1)
(exactlyLocated ?PART2 ?PART1))))))
| | | TransitiveRelation | |
| 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 | |
| crosses | | | trichotomizingOn | inverse | (crosses ?OBJ1 ?OBJ2) means that Object ?OBJ1 traverses Object ?OBJ2, without being connected to it | | (=>
(traverses ?OBJ1 ?OBJ2)
(or
(crosses ?OBJ1 ?OBJ2)
(penetrates ?OBJ1 ?OBJ2)))
| | | TransitiveRelation | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 |
| 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 | |
| front | | | trichotomizingOn | inverse | This is a cognitive primitive, derived from the front/back schema. (front ?OBJ1 ?OBJ2) means that ?OBJ1 is in front of ?OBJ2 | behind | (=>
(instance ?REL TransitiveRelation)
(forall (?INST1 ?INST2 ?INST3)
(=>
(and
(holds ?REL ?INST1 ?INST2)
(holds ?REL ?INST2 ?INST3))
(holds ?REL ?INST1 ?INST3))))
| | | TransitiveRelation | |
| 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 | |
| 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 | |
| IntentionalRelation | | | trichotomizingOn | inverse | The Class of Relations between an Agent and an Entity, where the Relation requires that the Agent have awareness of the Entity | | (=>
(instance ?REL IrreflexiveRelation)
(forall (?INST)
(not
(holds ?REL ?INST ?INST))))
| | AsymmetricRelation | | |
| 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 | |
| left | | | trichotomizingOn | inverse | This is a cognitive primitive, derived from the left/right schema. (left ?OBJ1 ?OBJ2) means that ?OBJ1 is to the left ?OBJ2 | | (=>
(between ?OBJ1 ?OBJ2 ?OBJ3)
(and
(left ?OBJ2 ?OBJ1)
(left ?OBJ1 ?OBJ3)))
| | | TransitiveRelation | |
| 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 |
| on | | | trichotomizingOn | inverse | This is a cognitive primitive, derived from the up/down schema and involving contact. (on ?OBJ1 ?OBJ2) means that ?OBJ1 is on top of ?OBJ2 | | (=>
(under ?OBJ1 ?OBJ2)
(or
(on ?OBJ2 ?OBJ1)
(above ?OBJ2 ?OBJ1)))
| | | IntransitiveRelation | |
| 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 | |
| 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 | |
| penetrates | | | trichotomizingOn | inverse | (penetrates ?OBJ1 ?OBJ2) means that ?OBJ1 is connected to ?OBJ2 along at least one whole dimension (length, width or depth) | | (=>
(traverses ?OBJ1 ?OBJ2)
(or
(crosses ?OBJ1 ?OBJ2)
(penetrates ?OBJ1 ?OBJ2)))
| | | IntransitiveRelation | |
| 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 | |
| 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 | |
| properPart | | | trichotomizingOn | inverse | (properPart ?OBJ1 ?OBJ2) means that ?OBJ1 is a part of ?OBJ2 other than ?OBJ2 itself. This is a TransitiveRelation and AsymmetricRelation (hence an IrreflexiveRelation) | | (=>
(instance ?HOLE1 Hole)
(exists (?HOLE2)
(properPart ?HOLE2 ?HOLE1)))
| | | TransitiveRelation | |
| 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 | |
| realization | Proposition | Process | trichotomizingOn | inverse | A subrelation of represents. (realization ?PROCESS ?PROP) means that ?PROCESS is a Process which expresses the content of ?PROP. Examples include a particular musical performance, which realizes the content of a musical score, or the reading of a poem | | (=>
(realization ?PROCESS ?PROP)
(exists (?OBJ)
(and
(instance ?OBJ ContentBearingObject)
(containsInformation ?OBJ ?PROP))))
| | | AsymmetricRelation | equivalentContentInstance |
| 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 | |
| right | | | trichotomizingOn | inverse | This is a cognitive primitive, derived from the left/right schema. (right ?OBJ1 ?OBJ2) means that ?OBJ1 is to the right ?OBJ2 | left | (=>
(instance ?REL TransitiveRelation)
(forall (?INST1 ?INST2 ?INST3)
(=>
(and
(holds ?REL ?INST1 ?INST2)
(holds ?REL ?INST2 ?INST3))
(holds ?REL ?INST1 ?INST3))))
| | | TransitiveRelation | |
| 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 | |
| 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 | |
| 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 | |
| under | | | trichotomizingOn | inverse | This is a cognitive primitive, derived from the up/down schema. (under ?OBJ1 ?OBJ2) means that ?OBJ1 is under ?OBJ2 | | (=>
(under ?OBJ1 ?OBJ2)
(or
(on ?OBJ2 ?OBJ1)
(above ?OBJ2 ?OBJ1)))
| | | TransitiveRelation | |
| 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 | |
SUMO View all facts Glossary Help
