GraphArc - Sigma Knowledge base Browser

appearance as argument number 1

s__documentation(s__GraphArc,s__ChineseLanguage,'"Graph 是由 GraphNode 和 GraphArc 组成，每个 GraphArc 都会联系两个 GraphNode。"')	chinese_format.kif 2344-2345
s__documentation(s__GraphArc,s__EnglishLanguage,'"Graphs are comprised of GraphNodes and GraphArcs. Every GraphArc links two GraphNodes."')	Merge.kif 5491-5492
s__externalImage(s__GraphArc,'"http://upload.wikimedia.org/wikipedia/commons/5/ 5b/ 6n-graf.svg"')	pictureList.kif 1789-1789
s__instance(s__GraphArc,s__SetOrClass) s__subclass(s__GraphArc,s__GraphElement) s__instance(s__GraphElement,s__SetOrClass)	Merge.kif 5489-5489	Graph arc is a subclass of graph element

appearance as argument number 2

s__subclass(s__GraphLoop,s__GraphArc)

s__instance(s__GraphArc,s__SetOrClass)

s__instance(s__GraphLoop,s__SetOrClass)

Merge.kif 5499-5499

Graph loop is a subclass of graph arc

s__termFormat(s__ChineseLanguage,s__GraphArc,'"图弧"')

chinese_format.kif 942-942

s__termFormat(s__EnglishLanguage,s__GraphArc,'"graph arc"')

english_format.kif 1096-1096

appearance as argument number 3

s__domain(s__InitialNodeFn__m,n__1,s__GraphArc)	Merge.kif 5567-5567	The number 1 argument of initial node is an instance of graph arc
s__domain(s__TerminalNodeFn__m,n__1,s__GraphArc)	Merge.kif 5577-5577	The number 1 argument of terminal node is an instance of graph arc
s__domain(s__arcWeight__m,n__1,s__GraphArc)	Merge.kif 5609-5609	The number 1 argument of arc weight is an instance of graph arc
s__domain(s__links__m,n__3,s__GraphArc)	Merge.kif 5518-5518	The number 3 argument of links is an instance of graph arc
s__partition__3(s__GraphElement,s__GraphNode,s__GraphArc)	Merge.kif 5467-5467	Graph element is exhaustively partitioned into graph node and graph arc

antecedent

( ! [V__PA,V__G,V__AN,V__PN,V__M,V__N,V__AA] : ((s__instance(V__PA,s__Object) & s__instance(V__G,s__Graph) & s__instance(V__PN,s__Physical) & s__instance(V__M,s__UnitOfMeasure) & s__instance(V__N,s__RealNumber)) => (s__graphMeasure(V__G,V__M) & s__instance(V__AN,s__GraphNode) & s__graphPart(V__AN,V__G) & s__graphPart(V__AA,V__G) & s__instance(V__AA,s__GraphArc) & s__abstractCounterpart(V__AN,V__PN) & s__abstractCounterpart(V__AA,V__PA) & s__arcWeight(V__AA,s__MeasureFn(V__N,V__M))) => s__measure(V__PA,s__MeasureFn(V__N,V__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)
( ! [V__ARC,V__GRAPH] : ((s__instance(V__GRAPH,s__DirectedGraph) & s__instance(V__ARC,s__GraphArc) & s__graphPart(V__ARC,V__GRAPH)) => ( ? [V__NODE1, V__NODE2] : ((s__instance(V__NODE1,s__GraphNode) & s__instance(V__NODE2,s__GraphNode) & ((s__InitialNodeFn(V__ARC) = V__NODE1) & (s__TerminalNodeFn(V__ARC) = V__NODE2))))) ) )	Merge.kif 5348-5356	If a graph is an instance of directed graph and a graph arc is an instance of graph arc and the graph arc is a part of the graph, then there exist a graph node and another graph node such that the starting node of the graph arc is equal to the graph node and the terminal node of the graph arc is equal to the other graph node
( ! [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
( ! [V__ARC] : (s__instance(V__ARC,s__GraphArc) => ( ? [V__NODE1, V__NODE2] : ((s__instance(V__NODE1,s__GraphNode) & s__instance(V__NODE2,s__GraphNode) & s__links(V__NODE1,V__NODE2,V__ARC)))) ) )	Merge.kif 5494-5497	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

consequent

( ! [V__T,V__G,V__TS] :
   (s__instance(V__G,s__Graph) =>
     (s__instance(V__TS,s__TransitSystem) &
       s__instance(V__T,s__Transitway) &
       s__abstractCounterpart(V__G,V__TS)
     &
     s__systemPart(V__T,V__TS))
=>
( ? [V__GA] :
   ((s__instance(V__GA,s__GraphArc) &
       s__abstractCounterpart(V__GA,V__T)
     &
     s__graphPart(V__GA,V__G))))
)
)

Transportation.kif 2824-2834

If a physical system is an instance of transit system and a physical is an instance of transitway 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 graphA such that the graphA is an instance of graph arc and the abstract counterpart of the physical is the graphA and the graphA 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: