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

Formal Language: 



KB Term: 

  ProcessSuccess

Sigma KEE - spouse
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
spouse
The relationship of marriage between two Humans.
Relationships      
Parents legal relation (legalRelation ?AGENT1 ?AGENT2) means that ?AGENT1 and ?AGENT2 are relatives by virtue of a legal relationship. Some examples include marriage, adoption, etc.
  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.
  relative (relative ?O1 ?O2) means that ?O1 and ?O2 are relatives, whether through common ancestry (consanguinity), someone's marriage (affinity), or someone's adoption. This definition is intentionally broad, so as to capture a wide array of `familial' relations. The notion of who counts as `family' also varies between cultures, but that aspect of meaning is not addressed here.
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.
 irreflexive relationRelation ?REL is irreflexive iff (?REL ?INST ?INST) holds for no value of ?INST.
 partial valued relationA Relation is a PartialValuedRelation just in case it is not a TotalValuedRelation, i.e. just in case assigning values to every argument position except the last one does not necessarily mean that there is a value assignment for the last argument position. Note that, if a Relation is both a PartialValuedRelation and a SingleValuedRelation, then it is a partial function.
 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 two kinds of Relation: Predicate and Function. 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.
 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 full definition (without tree view)
Show full definition (with tree view)

Show without tree


Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 3.0 is open source software produced by Articulate Software and its partners