subGraph - Sigma Knowledge base Browser

Browsing Interface : Welcome guest : log in

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

KB Term:			Term intersection

English Word:

Sigma KEE - subGraph

subGraph

appearance as argument number 1

(documentation subGraph ChineseLanguage "这是形容两个 Graph，而其中一个图是另外一个图的一部分时的关系，(subGraph ?GRAPH1 ?GRAPH2)的意思是 ?GRAPH1 是 ?GRAPH2 的一部分。")	chinese_format.kif 2351-2352
(documentation subGraph EnglishLanguage "The relation between two Graphs when one Graph is a part of the other. (subGraph ?GRAPH1 ?GRAPH2) means that ?GRAPH1 is a part of ?GRAPH2.")	Merge.kif 5799-5801
(domain subGraph 1 Graph)	Merge.kif 5796-5796	The number 1 argument of sub graph is an instance of graph
(domain subGraph 2 Graph)	Merge.kif 5797-5797	The number 2 argument of sub graph is an instance of graph
(instance subGraph BinaryPredicate)	Merge.kif 5793-5793	sub graph is an instance of binary predicate
(instance subGraph ReflexiveRelation)	Merge.kif 5794-5794	sub graph is an instance of reflexive relation
(instance subGraph TransitiveRelation)	Merge.kif 5795-5795	sub graph is an instance of transitive relation

appearance as argument number 2

(format ChineseLanguage subGraph "%1 %n 是 %2 的 subGraph")	chinese_format.kif 751-751
(format EnglishLanguage subGraph "%1 is %n a subgraph of %2")	english_format.kif 753-753
(termFormat ChineseLanguage subGraph "子图")	chinese_format.kif 752-752
(termFormat ChineseTraditionalLanguage subGraph "子圖")	domainEnglishFormat.kif 55706-55706
(termFormat EnglishLanguage subGraph "sub graph")	domainEnglishFormat.kif 55705-55705

antecedent

(=> (and (equal (PathWeightFn ?PATH) ?SUM) (subGraph ?SUBPATH ?PATH) (graphPart ?ARC1 ?PATH) (arcWeight ?ARC1 ?NUMBER1) (forall (?ARC2) (=> (graphPart ?ARC2 ?PATH) (or (graphPart ?ARC2 ?SUBPATH) (equal ?ARC2 ?ARC1))))) (equal ?SUM (AdditionFn (PathWeightFn ?SUBPATH) ?NUMBER1)))	Merge.kif 5877-5889	If the value of a graph path is equal to a real number and another graph path is a subgraph of the graph path and a graph arc is a part of the graph path and the value of the graph arc is another real number and for all a graph element if the graph element is a part of the graph path, then the graph element is a part of the other graph path or the graph element is equal to the graph arc , then the real number is equal to (the value of the other graph path and the other real number)
(=> (and (subGraph ?GRAPH1 ?GRAPH2) (graphPart ?ELEMENT ?GRAPH1)) (graphPart ?ELEMENT ?GRAPH2))	Merge.kif 5803-5807	If a graph is a subgraph of another graph and a graph element is a part of the graph, then the graph element is a part of the other graph

consequent

(=> (and (distanceOnPath ?DIST ?PATH) (pathInSystem ?PATH ?SYS) (routeStart ?START ?PATH) (routeEnd ?END ?PATH) (abstractCounterpart ?GRAPH ?SYS)) (exists (?S ?BN ?EN) (and (subGraph ?S ?GRAPH) (equal ?BN (BeginNodeFn ?GRAPH)) (equal ?EN (EndNodeFn ?GRAPH)) (abstractCounterpart ?BN ?START) (abstractCounterpart ?EN ?END))))	Transportation.kif 2813-2826	If the distance of a transitway is a constant quantity and a transit system is a path in system of the transitway and a region is the start of the transitway and another region is the end of the transitway and the abstract counterpart of the transit system is a graph path, then there exist a graph, a graph node and another graph node such that the graph is a subgraph of the graph path and the graph node is equal to the beginning of the graph path and the other graph node is equal to the end of the graph path and the abstract counterpart of the region is the graph node and the abstract counterpart of the other region is the other graph node
(=> (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 5530-5550	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

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