Browsing Interface : Welcome guest : log in
|
Browsing Interface : Welcome guest : log in |
[
Home |
Graph |
LogLearn |
Editor |
]
KB:
Language:
Formal Language:
|
 |
   CommutativeFunction
|
|
|
| appearance as argument number 1 |
|
|
| (subclass GraphLoop GraphArc) | Merge.kif 5972-5972 | Graph loop is a subclass of graph arc |
| (documentation GraphLoop EnglishLanguage "A GraphArc in which a GraphNode is linked to itself.") | Merge.kif 5974-5975 | Graph loop is a subclass of graph arc |
| (externalImage GraphLoop "http://upload.wikimedia.org/wikipedia/commons/ 2/ 28/ 6n_graph2.svg") | pictureList.kif 1789-1789 | Graph loop is a subclass of graph arc |
| appearance as argument number 2 |
|
|
| (termFormat EnglishLanguage GraphLoop "graph loop") | english_format.kif 1097-1097 |
| antecedent |
|
|
| (=> (and (instance ?LOOP GraphLoop) (graphPart ?LOOP ?GRAPH)) (instance ?GRAPH PseudoGraph)) |
Merge.kif 5933-5937 | If X is an instance of graph loop and X is a part of Y, then Y is an instance of pseudo graph |
| (=> (instance ?LOOP GraphLoop) (exists (?NODE) (links ?NODE ?NODE ?LOOP))) |
Merge.kif 5977-5980 | If X is an instance of graph loop, then there exists Y such that X links Y and Y |
| consequent |
|
|
| (=> (instance ?GRAPH Tree) (not (exists (?LOOP) (and (instance ?LOOP GraphLoop) (graphPart ?LOOP ?GRAPH))))) |
Merge.kif 5810-5816 | If X is an instance of tree, then there doesn't exist Y such that Y is an instance of graph loop and Y is a part of X |
| (=> (instance ?GRAPH PseudoGraph) (exists (?LOOP) (and (instance ?LOOP GraphLoop) (graphPart ?LOOP ?GRAPH)))) |
Merge.kif 5926-5931 | If X is an instance of pseudo graph, then there exists Y such that Y is an instance of graph loop and Y is a part of X |
| (=> (links ?NODE ?NODE ?LOOP) (instance ?LOOP GraphLoop)) |
Merge.kif 5982-5984 | If X links Y and Y, then X is an instance of graph loop |
| (=> (and (equal (InitialNodeFn ?ARC) ?NODE) (equal (TerminalNodeFn ?ARC) ?NODE)) (instance ?ARC GraphLoop)) |
Merge.kif 5986-5990 | If equal the starting node of X and Y and equal the terminal node of X and Y, then X is an instance of graph loop |
|
