GraphLoop - Sigma Knowledge base Browser

Browsing Interface : Welcome guest : log in

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

KB Term:			Term intersection

English Word:

Sigma KEE - GraphLoop

GraphLoop(graph loop)

appearance as argument number 1

(documentation GraphLoop ChineseLanguage "这是一个由 GraphNode 联系着自己的 GraphArc。")	chinese_format.kif 2346-2346
(documentation GraphLoop EnglishLanguage "A GraphArc in which a GraphNode is linked to itself.")	Merge.kif 5821-5822
(externalImage GraphLoop "http://upload.wikimedia.org/wikipedia/commons/ 2/ 28/ 6n-graph2.svg")	pictureList.kif 1791-1791
(subclass GraphLoop GraphArc)	Merge.kif 5819-5819	Graph loop is a subclass of graph arc

appearance as argument number 2

(termFormat ChineseLanguage GraphLoop "图环路")	chinese_format.kif 943-943
(termFormat EnglishLanguage GraphLoop "graph loop")	english_format.kif 1093-1093

antecedent

(=> (and (instance ?LOOP GraphLoop) (graphPart ?LOOP ?GRAPH)) (instance ?GRAPH PseudoGraph))	Merge.kif 5780-5784	If a graph element is an instance of graph loop and the graph element is a part of a graph, then the graph is an instance of pseudo graph
(=> (instance ?LOOP GraphLoop) (exists (?NODE) (links ?NODE ?NODE ?LOOP)))	Merge.kif 5824-5827	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

consequent

(=> (and (equal (InitialNodeFn ?ARC) ?NODE) (equal (TerminalNodeFn ?ARC) ?NODE)) (instance ?ARC GraphLoop))	Merge.kif 5833-5837	If the starting node of a graph arc is equal to a graph node and the terminal node of the graph arc is equal to the graph node, then the graph arc is an instance of graph loop
(=> (instance ?GRAPH PseudoGraph) (exists (?LOOP) (and (instance ?LOOP GraphLoop) (graphPart ?LOOP ?GRAPH))))	Merge.kif 5773-5778	If a graph is an instance of pseudo graph, then there exists a graph element such that the graph element is an instance of graph loop and the graph element is a part of the graph
(=> (instance ?GRAPH Tree) (not (exists (?LOOP) (and (instance ?LOOP GraphLoop) (graphPart ?LOOP ?GRAPH)))))	Merge.kif 5657-5663	If a graph is an instance of tree, then there doesn't exist a graph element such that the graph element is an instance of graph loop and the graph element is a part of the graph
(=> (links ?NODE ?NODE ?LOOP) (instance ?LOOP GraphLoop))	Merge.kif 5829-5831	If a graph arc links a graph node and the graph node, then the graph arc is an instance of graph loop

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