links - Sigma Knowledge base Browser

Browsing Interface : Welcome guest : log in

[ Home | Graph | ] KB: Language:
Formal Language:

KB Term:			Term intersection

English Word:

Sigma KEE - links

links

appearance as argument number 1

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 2347-2348
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5902-5903
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 1022-1023
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5898-5898	The number 1 argument of links is an instance of graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5899-5899	The number 2 argument of links is an instance of graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5900-5900	The number 3 argument of links is an instance of graph arc
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5897-5897	links is an instance of ternary predicate

appearance as argument number 2

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 747-747
No TPTP formula. May not be expressible in strict first order.	english_format.kif 749-749
No TPTP formula. May not be expressible in strict first order.	french_format.kif 451-451
No TPTP formula. May not be expressible in strict first order.	relations-it.txt 165-165
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 2159-2159
No TPTP formula. May not be expressible in strict first order.	portuguese_format.kif 403-403
No TPTP formula. May not be expressible in strict first order.	relations-cz.txt 464-464
No TPTP formula. May not be expressible in strict first order.	relations-de.txt 963-963
No TPTP formula. May not be expressible in strict first order.	relations-hindi.txt 204-204
No TPTP formula. May not be expressible in strict first order.	relations-ro.kif 473-473
No TPTP formula. May not be expressible in strict first order.	relations-sv.txt 516-516
No TPTP formula. May not be expressible in strict first order.	relations-tg.txt 329-329
No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 748-748
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 34570-34570
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 34569-34569
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 34568-34568
No TPTP formula. May not be expressible in strict first order.	terms-de.txt 295-295
No TPTP formula. May not be expressible in strict first order.	relations-tg.txt 330-330

antecedent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5815-5824	If a graph arc is a part of a graph and another graph arc is a part of the graph and a graph node is a part of the graph and another graph node is a part of the graph and the graph arc links the graph node and the other graph node and the other graph arc links the graph node and the other graph node and equal the graph arc and the other graph arc, then the graph is an instance of multi graph
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5887-5889	If a graph arc links a graph node and the graph node, then the graph arc is an instance of graph loop
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5905-5907	If a graph arc links a graph node and another graph node, then the graph arc links the other graph node and the graph node

consequent

No TPTP formula. May not be expressible in strict first order.	Transportation.kif 3468-3474	If an object connects another object and a third object and the abstract counterpart of the other object is a graph node and the abstract counterpart of the third object is another graph node and the abstract counterpart of the object is the objectRC, then the objectRC links the graph node and the other graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5655-5675	If a graph is an instance of graph and a graph node is an instance of graph node and another graph node is an instance of graph node and the graph node is a part of the graph and the other graph node is a part of the graph and equal the graph node and the other graph node, then there exist a graph arc and a graph path such that the graph arc links the graph node and the other graph node or the graph path is a subgraph of the graph and the graph path is an instance of graph path and equal the beginning of the graph path and the graph node and equal the end of the graph path and the other graph node or equal the beginning of the graph path and the other graph node and equal the end of the graph path and the graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5872-5875	If a graph arc is an instance of graph arc, then there exist a graph node and another graph node such that the graph arc links the graph node and the other graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5677-5691	If a graph is an instance of graph, then there exist a graph node, another graph node,, , a third graph node,, , a graph arc and another graph arc such that the graph node is a part of the graph and the other graph node is a part of the graph and the third graph node is a part of the graph and the graph arc is a part of the graph and the other graph arc is a part of the graph and the graph arc links the graph node and the other graph node and the other graph arc links the other graph node and the third graph node and equal the graph node and the other graph node and equal the other graph node and the third graph node and equal the graph node and the third graph node and equal the graph arc and the other graph arc
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5802-5813	If a graph is an instance of multi graph, then there exist a graph arc, another graph arc,, , a graph node and another graph node such that the graph arc is a part of the graph and the other graph arc is a part of the graph and the graph node is a part of the graph and the other graph node is a part of the graph and the graph arc links the graph node and the other graph node and the other graph arc links the graph node and the other graph node and equal the graph arc and the other graph arc
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5882-5885	If a graph arc is an instance of graph loop, then there exists a graph node such that the graph arc links the graph node and the graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5862-5865	If a graph node is an instance of graph node, then there exist another graph node and a graph arc such that the graph arc links the graph node and the other graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5905-5907	If a graph arc links a graph node and another graph node, then the graph arc links the other graph node and the graph node

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

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