GraphNode - Sigma Knowledge base Browser

appearance as argument number 1

(documentation GraphNode ChineseLanguage "Graph 是由 GraphNode 和 GraphArc 组成，所有的 GraphNode 都是由 GraphArc 联系的.")	chinese_format.kif 2342-2343
(documentation GraphNode EnglishLanguage "Graphs are comprised of GraphNodes and GraphArcs. Every GraphNode is linked by a GraphArc.")	Merge.kif 5481-5482
(externalImage GraphNode "http://upload.wikimedia.org/wikipedia/commons/ 5/ 5b/ 6n-graf.svg")	pictureList.kif 1792-1792
(subclass GraphNode GraphElement)	Merge.kif 5479-5479	Graph node is a subclass of graph element

appearance as argument number 2

(partition GraphElement GraphNode GraphArc)	Merge.kif 5467-5467	Graph element is exhaustively partitioned into graph node and graph arc
(range BeginNodeFn GraphNode)	Merge.kif 5588-5588	The range of begin node is an instance of graph node
(range EndNodeFn GraphNode)	Merge.kif 5599-5599	The range of end node is an instance of graph node
(range InitialNodeFn GraphNode)	Merge.kif 5568-5568	The range of initial node is an instance of graph node
(range TerminalNodeFn GraphNode)	Merge.kif 5578-5578	The range of terminal node is an instance of graph node
(termFormat ChineseLanguage GraphNode "图节点")	chinese_format.kif 941-941
(termFormat EnglishLanguage GraphNode "graph node")	english_format.kif 1094-1094

appearance as argument number 3

(domain GraphPathFn 1 GraphNode)	Merge.kif 5705-5705	The number 1 argument of graph path is an instance of graph node
(domain GraphPathFn 2 GraphNode)	Merge.kif 5706-5706	The number 2 argument of graph path is an instance of graph node
(domain MaximalWeightedPathFn 1 GraphNode)	Merge.kif 5680-5680	The number 1 argument of maximal weighted path is an instance of graph node
(domain MaximalWeightedPathFn 2 GraphNode)	Merge.kif 5681-5681	The number 2 argument of maximal weighted path is an instance of graph node
(domain MinimalWeightedPathFn 1 GraphNode)	Merge.kif 5655-5655	The number 1 argument of minimal weighted path is an instance of graph node
(domain MinimalWeightedPathFn 2 GraphNode)	Merge.kif 5656-5656	The number 2 argument of minimal weighted path is an instance of graph node
(domain links 1 GraphNode)	Merge.kif 5516-5516	The number 1 argument of links is an instance of graph node
(domain links 2 GraphNode)	Merge.kif 5517-5517	The number 2 argument of links is an instance of graph node

antecedent

(=> (and (graphMeasure ?G ?M) (instance ?AN GraphNode) (graphPart ?AN ?G) (graphPart ?AA ?G) (instance ?AA GraphArc) (abstractCounterpart ?AN ?PN) (abstractCounterpart ?AA ?PA) (arcWeight ?AA (MeasureFn ?N ?M))) (measure ?PA (MeasureFn ?N ?M)))	Merge.kif 5816-5826	If an unit of measure is the unit in a graph and a graph element is an instance of graph node and the graph element is a part of the graph and a graph arc is a part of the graph and the graph arc is an instance of graph arc and the abstract counterpart of a physical is the graph element and the abstract counterpart of an object is the graph arc and the value of the graph arc is a real number the unit of measure(s), then the measure of the object is the real number the unit of measure(s)
(=> (and (instance ?GRAPH Graph) (instance ?NODE1 GraphNode) (instance ?NODE2 GraphNode) (graphPart ?NODE1 ?GRAPH) (graphPart ?NODE2 ?GRAPH) (not (equal ?NODE1 ?NODE2))) (exists (?ARC ?PATH) (or (links ?NODE1 ?NODE2 ?ARC) (and (subGraph ?PATH ?GRAPH) (instance ?PATH GraphPath) (or (and (equal (BeginNodeFn ?PATH) ?NODE1) (equal (EndNodeFn ?PATH) ?NODE2)) (and (equal (BeginNodeFn ?PATH) ?NODE2) (equal (EndNodeFn ?PATH) ?NODE1)))))))	Merge.kif 5303-5323	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 the graph node is not equal to 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 the beginning of the graph path is equal to the graph node and the end of the graph path is equal to the other graph node or the beginning of the graph path is equal to the other graph node and the end of the graph path is equal to the graph node
(=> (instance ?NODE GraphNode) (exists (?OTHER ?ARC) (links ?NODE ?OTHER ?ARC)))	Merge.kif 5484-5487	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

consequent

(=>
    (and
        (instance ?TS TransitSystem)
        (instance ?TJ TransitwayJunction)
        (abstractCounterpart ?G ?TS)
        (systemPart ?TJ ?TS))
    (exists (?GN)
        (and
            (instance ?GN GraphNode)
            (abstractCounterpart ?GN ?TJ)
            (graphPart ?GN ?G))))

Transportation.kif 2836-2846

If a physical system is an instance of transit system and a physical is an instance of transitway junction and the abstract counterpart of the physical system is a graph and the physical system is a system part of the physical,
then there exists the graphN such that the graphN is an instance of graph node and the abstract counterpart of the physical is the graphN and the graphN is a part of the graph

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 2.99c (>= 2017/11/20) is open source software produced by Articulate Software and its partners

KB Term:			Term intersection

English Word: