GraphArc - Sigma Knowledge base Browser

appearance as argument number 1

(documentation GraphArc ChineseLanguage "Graph 是由 GraphNode 和 GraphArc 组成，每个 GraphArc 都会联系两个 GraphNode。")	chinese_format.kif 2344-2345
(documentation GraphArc EnglishLanguage "Graphs are comprised of GraphNodes and GraphArcs. Every GraphArc links two GraphNodes.")	Merge.kif 5845-5846
(documentation GraphArc JapaneseLanguage "Graph は GraphNode および GraphArc で構成される。すべての GraphArc は２つの GraphNode をリンクする。")	japanese_format.kif 1018-1019
(externalImage GraphArc "http://upload.wikimedia.org/wikipedia/commons/5/ 5b/ 6n-graf.svg")	pictureList.kif 1788-1788
(subclass GraphArc GraphElement)	Merge.kif 5843-5843	Graph arc is a subclass of graph element

appearance as argument number 2

(subclass GraphLoop GraphArc)	Merge.kif 5853-5853	Graph loop is a subclass of graph arc
(termFormat ChineseLanguage GraphArc "图弧")	chinese_format.kif 942-942	Graph loop is a subclass of graph arc
(termFormat EnglishLanguage GraphArc "graph arc")	english_format.kif 1091-1091	Graph loop is a subclass of graph arc
(termFormat FrenchLanguage GraphArc "arc du graph")	french_format.kif 618-618	Graph loop is a subclass of graph arc
(termFormat Hindi GraphArc "chaapa aalekha")	terms-hindi.txt 149-149	Graph loop is a subclass of graph arc
(termFormat ItalianLanguage GraphArc "arco del grafo")	terms-it.txt 152-152	Graph loop is a subclass of graph arc
(termFormat JapaneseLanguage GraphArc "グラフアーク")	japanese_format.kif 2303-2303	Graph loop is a subclass of graph arc
(termFormat PortugueseLanguage GraphArc "Arco do Grafo")	portuguese_format.kif 570-570	Graph loop is a subclass of graph arc
(termFormat cz GraphArc "graph arc")	terms-cz.txt 186-186	Graph loop is a subclass of graph arc
(termFormat ro GraphArc "arc de graf")	relations-ro.kif 639-639	Graph loop is a subclass of graph arc
(termFormat tg GraphArc "talaguhitang hubog")	terms-tg.txt 153-153	Graph loop is a subclass of graph arc

appearance as argument number 3

(domain InitialNodeFn 1 GraphArc)	Merge.kif 5923-5923	The number 1 argument of initial node is an instance of graph arc
(domain TerminalNodeFn 1 GraphArc)	Merge.kif 5933-5933	The number 1 argument of terminal node is an instance of graph arc
(domain arcWeight 1 GraphArc)	Merge.kif 5965-5965	The number 1 argument of arc weight is an instance of graph arc
(domain links 3 GraphArc)	Merge.kif 5876-5876	The number 3 argument of links is an instance of graph arc
(partition GraphElement GraphNode GraphArc)	Merge.kif 5821-5821	Graph element is exhaustively partitioned into graph node and graph arc

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 ?N)) (measure ?PA (MeasureFn ?N ?M)))	Merge.kif 6166-6177	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 another physical is the graph arc and the value of the graph arc is a real number, then the measure of the other physical is the real number the unit of measure(s)
(=> (and (instance ?GRAPH DirectedGraph) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH)) (exists (?NODE1 ?NODE2) (and (equal (InitialNodeFn ?ARC) ?NODE1) (equal (TerminalNodeFn ?ARC) ?NODE2))))	Merge.kif 5676-5684	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
(=> (and (instance ?GRAPH GraphPath) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH) (equal (InitialNodeFn ?ARC) ?NODE)) (not (exists (?OTHER) (and (equal (InitialNodeFn ?OTHER) ?NODE) (not (equal ?OTHER ?ARC))))))	Merge.kif 5727-5738	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 and 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
(=> (and (instance ?GRAPH GraphPath) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH) (equal (TerminalNodeFn ?ARC) ?NODE)) (not (exists (?OTHER) (and (equal (TerminalNodeFn ?OTHER) ?NODE) (not (equal ?OTHER ?ARC))))))	Merge.kif 5740-5751	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 and 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
(=> (instance ?ARC GraphArc) (exists (?NODE1 ?NODE2) (links ?NODE1 ?NODE2 ?ARC)))	Merge.kif 5848-5851	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

(=>
    (and
        (instance ?TS TransitSystem)
        (instance ?T Transitway)
        (abstractCounterpart ?G ?TS)
        (systemPart ?T ?TS))
    (exists (?GA)
        (and
            (instance ?GA GraphArc)
            (abstractCounterpart ?GA ?T)
            (graphPart ?GA ?G))))

Transportation.kif 3435-3445

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 3.0 is open source software produced by Articulate Software and its partners

KB Term:			Term intersection

English Word: