GraphPath - Sigma Knowledge base Browser

appearance as argument number 1

s__documentation(s__GraphPath,s__ChineseLanguage,'"非形式来说，这是一个 Graph 的两个 GraphNode 之间的单一有向的路径。形式的说，这是一个 DirectedGraph，它是原来的 Graph 的 subGraph，而使得这个 DirectedGraph 里没有两个 GraphArc 有着相同的始点(可参考 InitialNodeFn) 或相同的终点 (可参考 TerminalNodeFn)。"')

chinese_format.kif 2330-2333

s__documentation(s__GraphPath,s__EnglishLanguage,'"Informally, a single, directed route between two GraphNodes in a Graph. Formally, a DirectedGraph that is a subGraph of the original Graph and such that no two GraphArcs in the DirectedGraph have the same initial node (see InitialNodeFn) or the same terminal node (see TerminalNodeFn)."')

Merge.kif 5393-5397

s__subclass(s__GraphPath,s__DirectedGraph)

s__instance(s__DirectedGraph,s__SetOrClass)

s__instance(s__GraphPath,s__SetOrClass)

Merge.kif 5391-5391

Graph path is a subclass of directed graph

appearance as argument number 2

s__range(s__MaximalWeightedPathFn__m,s__GraphPath)	Merge.kif 5682-5682	The range of maximal weighted path is an instance of graph path
s__range(s__MinimalWeightedPathFn__m,s__GraphPath)	Merge.kif 5657-5657	The range of minimal weighted path is an instance of graph path
s__rangeSubclass(s__CutSetFn__m,s__GraphPath)	Merge.kif 5723-5723	The values returned by cut set are subclasses of graph path
s__rangeSubclass(s__GraphPathFn__m,s__GraphPath)	Merge.kif 5707-5707	The values returned by graph path are subclasses of graph path
s__rangeSubclass(s__MinimalCutSetFn__m,s__GraphPath)	Merge.kif 5731-5731	The values returned by minimal cut set are subclasses of graph path
s__instance(s__GraphCircuit,s__SetOrClass) s__subclass(s__GraphCircuit,s__GraphPath) s__instance(s__GraphPath,s__SetOrClass)	Merge.kif 5423-5423	Graph circuit is a subclass of graph path
s__termFormat(s__ChineseLanguage,s__GraphPath,'"图路径"')	chinese_format.kif 936-936
s__termFormat(s__EnglishLanguage,s__GraphPath,'"graph path"')	english_format.kif 1084-1084

appearance as argument number 3

s__domain(s__BeginNodeFn__m,n__1,s__GraphPath)	Merge.kif 5587-5587	The number 1 argument of begin node is an instance of graph path
s__domain(s__EndNodeFn__m,n__1,s__GraphPath)	Merge.kif 5598-5598	The number 1 argument of end node is an instance of graph path
s__domain(s__PathWeightFn__m,n__1,s__GraphPath)	Merge.kif 5617-5617	The number 1 argument of path weight is an instance of graph path
s__domain(s__pathLength__m,n__1,s__GraphPath)	Merge.kif 5557-5557	The number 1 argument of path length is an instance of graph path

antecedent

( ! [V__NODE,V__ARC,V__GRAPH] : (s__instance(V__NODE,s__GraphNode) => (s__instance(V__GRAPH,s__GraphPath) & s__instance(V__ARC,s__GraphArc) & s__graphPart(V__ARC,V__GRAPH)) => (s__InitialNodeFn(V__ARC) = V__NODE) => ~(( ? [V__OTHER] : ((s__instance(V__OTHER,s__GraphArc) & ((s__InitialNodeFn(V__OTHER) = V__NODE) & ~((V__OTHER = V__ARC))))))) ) )	Merge.kif 5399-5409	If a graph is an instance of graph path and a graph arc is an instance of graph arc and the graph arc is a part of the graph, then if the starting node of the graph arc is equal to a graph node, then there doesn't exist another graph arc such that the starting node of the other graph arc is equal to the graph node and the other graph arc is not equal to the graph arc
( ! [V__NODE,V__ARC,V__GRAPH] : (s__instance(V__NODE,s__GraphNode) => (s__instance(V__GRAPH,s__GraphPath) & s__instance(V__ARC,s__GraphArc) & s__graphPart(V__ARC,V__GRAPH)) => (s__TerminalNodeFn(V__ARC) = V__NODE) => ~(( ? [V__OTHER] : ((s__instance(V__OTHER,s__GraphArc) & ((s__TerminalNodeFn(V__OTHER) = V__NODE) & ~((V__OTHER = V__ARC))))))) ) )	Merge.kif 5411-5421	If a graph is an instance of graph path and a graph arc is an instance of graph arc and the graph arc is a part of the graph, then if the terminal node of the graph arc is equal to a graph node, then there doesn't exist another graph arc such that the terminal node of the other graph arc is equal to the graph node and the other graph arc is not equal to the graph arc

consequent

( ! [V__NODE2,V__NODE1,V__GRAPH] : ((s__instance(V__GRAPH,s__Graph) & s__instance(V__NODE1,s__GraphNode) & s__instance(V__NODE2,s__GraphNode) & s__graphPart(V__NODE1,V__GRAPH) & s__graphPart(V__NODE2,V__GRAPH) & ~((V__NODE1 = V__NODE2))) => ( ? [V__ARC, V__PATH] : ((s__instance(V__ARC,s__GraphArc) & (s__links(V__NODE1,V__NODE2,V__ARC) \| (s__subGraph(V__PATH,V__GRAPH) & s__instance(V__PATH,s__GraphPath) & (((s__BeginNodeFn(V__PATH) = V__NODE1) & (s__EndNodeFn(V__PATH) = V__NODE2)) \| ((s__BeginNodeFn(V__PATH) = V__NODE2) & (s__EndNodeFn(V__PATH) = V__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
( ! [V__DIST,V__PATH] : ((s__instance(V__DIST,s__ConstantQuantity) & s__instance(V__PATH,s__Transitway)) => s__distanceOnPath(V__DIST,V__PATH) => ( ? [V__GP] : ((s__instance(V__GP,s__GraphPath) & s__abstractCounterpart(V__GP,V__PATH)))) ) )	Transportation.kif 2777-2782	If the distance of a transitway is a constant quantity, then there exists an abstract such that the abstract is an instance of graph path and the abstract counterpart of the transitway is the abstract

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: