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

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 2330-2333
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5745-5749
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 1004-1007
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5743-5743	Graph path is a subclass of directed graph

appearance as argument number 2

No TPTP formula. May not be expressible in strict first order.	Merge.kif 6059-6059	The range of maximal weighted path is an instance of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6037-6037	The range of minimal weighted path is an instance of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6097-6097	The values returned by cut set are subclasses of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6081-6081	The values returned by graph path are subclasses of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6105-6105	The values returned by minimal cut set are subclasses of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5777-5777	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 936-936	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	english_format.kif 1079-1079	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	french_format.kif 612-612	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	terms-hindi.txt 143-143	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	terms-it.txt 146-146	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 2297-2297	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	portuguese_format.kif 564-564	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	terms-cb.txt 148-148	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	terms-cz.txt 180-180	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	terms-de.txt 439-439	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	relations-ro.kif 633-633	Graph circuit is a subclass of graph path
No TPTP formula. May not be expressible in strict first order.	terms-tg.txt 147-147	Graph circuit is a subclass of graph path

appearance as argument number 3

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5967-5967	The number 1 argument of begin node is an instance of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5978-5978	The number 1 argument of end node is an instance of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5997-5997	The number 1 argument of path weight is an instance of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5937-5937	The number 1 argument of path length is an instance of graph path

antecedent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5751-5762	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
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5764-5775	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

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5655-5675	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
No TPTP formula. May not be expressible in strict first order.	Transportation.kif 3397-3402	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