GraphPath - Sigma Knowledge base Browser

Browsing Interface : Welcome guest : log in

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

KB Term:			Term intersection

English Word:

Sigma KEE - GraphPath

GraphPath(graph path)

axis, coordinate_axis, dimension, major_axis, major_lobe, minor_axis, optic_axis, principal_axis, semimajor_axis, semiminor_axis, x-axis, y-axis, z-axis

appearance as argument number 1

(documentation GraphPath ChineseLanguage "非形式来说，这是一个 Graph 的两个 GraphNode 之间的单一有向的路径。形式的说，这是一个 DirectedGraph，它是原来的 Graph 的 subGraph，而使得这个 DirectedGraph 里没有两个 GraphArc 有着相同的始点(可参考 InitialNodeFn) 或相同的终点 (可参考 TerminalNodeFn)。")	chinese_format.kif 2330-2333
(documentation GraphPath 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 5770-5774
(documentation GraphPath JapaneseLanguage "非公式には、Graph 内の2つの GraphNode 間の単一の指向ルート。正式には、DirectedGraphは、元の Graph の subGraph であり、DirectedGraph 内の２つの GraphArc が同じ初期ノード (InitialNodeFn を参照) または同じ端末ノード (TerminalNodeFn を参照)を持たない。")	japanese_format.kif 1004-1007
(subclass GraphPath DirectedGraph)	Merge.kif 5768-5768	Graph path is a subclass of directed graph

appearance as argument number 2

(range MaximalWeightedPathFn GraphPath)	Merge.kif 6084-6084	The range of maximal weighted path is an instance of graph path
(range MinimalWeightedPathFn GraphPath)	Merge.kif 6062-6062	The range of minimal weighted path is an instance of graph path
(rangeSubclass CutSetFn GraphPath)	Merge.kif 6122-6122	The values returned by cut set are subclasses of graph path
(rangeSubclass GraphPathFn GraphPath)	Merge.kif 6106-6106	The values returned by graph path are subclasses of graph path
(rangeSubclass MinimalCutSetFn GraphPath)	Merge.kif 6130-6130	The values returned by minimal cut set are subclasses of graph path
(subclass GraphCircuit GraphPath)	Merge.kif 5802-5802	Graph circuit is a subclass of graph path
(termFormat ChineseLanguage GraphPath "图路径")	chinese_format.kif 936-936	Graph circuit is a subclass of graph path
(termFormat EnglishLanguage GraphPath "graph path")	english_format.kif 1079-1079	Graph circuit is a subclass of graph path
(termFormat FrenchLanguage GraphPath "chemin du graph")	french_format.kif 612-612	Graph circuit is a subclass of graph path
(termFormat Hindi GraphPath "aalekha patha")	terms-hindi.txt 143-143	Graph circuit is a subclass of graph path
(termFormat ItalianLanguage GraphPath "CamminoDelGrafo")	terms-it.txt 146-146	Graph circuit is a subclass of graph path
(termFormat JapaneseLanguage GraphPath "グラフパス")	japanese_format.kif 2297-2297	Graph circuit is a subclass of graph path
(termFormat PortugueseLanguage GraphPath "Caminho do Grafo")	portuguese_format.kif 564-564	Graph circuit is a subclass of graph path
(termFormat cb GraphPath "agianang agi")	terms-cb.txt 148-148	Graph circuit is a subclass of graph path
(termFormat cz GraphPath "graph path")	terms-cz.txt 180-180	Graph circuit is a subclass of graph path
(termFormat de GraphPath "Graphweg")	terms-de.txt 439-439	Graph circuit is a subclass of graph path
(termFormat ro GraphPath "cale intr-un graf")	relations-ro.kif 633-633	Graph circuit is a subclass of graph path
(termFormat tg GraphPath "bakas na talaguhitan")	terms-tg.txt 147-147	Graph circuit is a subclass of graph path

appearance as argument number 3

(domain BeginNodeFn 1 GraphPath)	Merge.kif 5992-5992	The number 1 argument of begin node is an instance of graph path
(domain EndNodeFn 1 GraphPath)	Merge.kif 6003-6003	The number 1 argument of end node is an instance of graph path
(domain PathWeightFn 1 GraphPath)	Merge.kif 6022-6022	The number 1 argument of path weight is an instance of graph path
(domain pathLength 1 GraphPath)	Merge.kif 5962-5962	The number 1 argument of path length is an instance of graph path

antecedent

(=> (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 5776-5787	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 equal the starting node of the graph arc and a graph node, then there doesn't exist another graph arc such that equal the starting node of the other graph arc and the graph node and equal the other graph arc and 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 5789-5800	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 equal the terminal node of the graph arc and a graph node, then there doesn't exist another graph arc such that equal the terminal node of the other graph arc and the graph node and equal the other graph arc and the graph arc

consequent

(=> (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 5680-5700	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 equal the graph node and 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 equal the beginning of the graph path and the graph node and equal the end of the graph path and the other graph node or equal the beginning of the graph path and the other graph node and equal the end of the graph path and the graph node
(=> (distanceOnPath ?DIST ?PATH) (exists (?GP) (and (instance ?GP GraphPath) (abstractCounterpart ?GP ?PATH))))	Transportation.kif 3396-3401	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 3.0 is open source software produced by Articulate Software and its partners