Simple Browser : Welcome guest : log in
Home |  Graph |  ]  KB:  Language:   

Formal Language: 




Sigma KEE - mutualAcquaintance
KB Term: 
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
mutual acquaintance
(mutualAcquaintance ?H1 ?H2) means that ?H1 and ?H2 have met each other and know something about each other, such as name and appearance. Statements made with this predicate should be temporally specified with holdsDuring. See also the weaker, non-symmetric version of this predicate, acquaintance.
Relationships      
Parents acquaintance (acquaintance ?H1 ?H2) means that ?H1 has met and knows something about ?H2, such as ?H2's name and appearance. Statements made with this predicate should be temporally specified with holdsDuring. Note that acquaintance is not symmetric. For the symmetric version, see mutualAcquaintance.
Children cohabitant(holdsDuring ?T1 (cohabitant ?H1 ?H2)) means that during the time ?T1, ?H1 and ?H2 have the same home.
 coworker(holdsDuring ?T1 (coworker ?H1 ?H2)) means that during time ?T1, ?H1 and ?H2 are both employed by the same agent, are of roughly the same job status, and come into contact at least part of the time at the same work location.
 friend(holdsDuring ?T1 (friend ?H1 ?H2)) means that during time ?T1, ?H1 and ?H2 know each other, share a relationship of mutual care and concern, and probably also share some common interests.
 spouseThe relationship of marriage between two Humans.
InstancesabstractProperties or qualities as distinguished from any particular embodiment of the properties/qualities in a physical medium. Instances of Abstract can be said to exist in the same sense as mathematical objects such as sets and relations, but they cannot exist at a particular place and time without some physical encoding or embodiment.
 binary predicateA Predicate relating two items - its valence is two.
 binary relationBinaryRelations are relations that are true only of pairs of things. BinaryRelations are represented as slots in frame systems.
 entityThe universal class of individuals. This is the root node of the ontology.
 inheritable relationThe class of Relations whose properties can be inherited downward in the class hierarchy via the subrelation Predicate.
 predicateA Predicate is a sentence-forming Relation. Each tuple in the Relation is a finite, ordered sequence of objects. The fact that a particular tuple is an element of a Predicate is denoted by '(*predicate* arg_1 arg_2 .. arg_n)', where the arg_i are the objects so related. In the case of BinaryPredicates, the fact can be read as `arg_1 is *predicate* arg_2' or `a *predicate* of arg_1 is arg_2'.
 relationThe Class of relations. There are three kinds of Relation: Predicate, Function, and List. Predicates and Functions both denote sets of ordered n-tuples. The difference between these two Classes is that Predicates cover formula-forming operators, while Functions cover term-forming operators. A List, on the other hand, is a particular ordered n-tuple.
 symmetric relationA BinaryRelation ?REL is symmetric just iff (?REL ?INST1 ?INST2) imples (?REL ?INST2 ?INST1), for all ?INST1 and ?INST2.
Belongs to Class entity


Show simplified definition with tree view
Show full definition (without tree view)
Show full definition (with tree view)


Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 2.99c (>= 2017/11/20) is open source software produced by Articulate Software and its partners