Browsing Interface : Welcome guest : log in 		[  Home |  Graph |  LogLearn |  Editor |  ]  KB:  Language: 
  Formal Language: 


KB Term:  Term intersection
English Word: 

Sigma KEE - GraphCircuit
GraphCircuit(graph circuit)

appearance as argument number 1
-------------------------


(subclass GraphCircuit GraphPath) Merge.kif 5872-5872 Graph circuit is a subclass of graph path
(documentation GraphCircuit EnglishLanguage "A GraphPath that begins (see BeginNodeFn) and ends (see EndNodeFn) at the same GraphNode.") Merge.kif 5874-5876 Graph circuit is a subclass of graph path
(externalImage GraphCircuit "http://upload.wikimedia.org/wikipedia/commons/ 5/ 50/ DC8.png") pictureList.kif 10035-10035 Graph circuit is a subclass of graph path
(externalImage GraphCircuit "http://upload.wikimedia.org/wikipedia/commons/ b/ b5/ Cycle_graph_C5.png") pictureList.kif 11086-11086 Graph circuit is a subclass of graph path
(externalImage GraphCircuit "http://upload.wikimedia.org/wikipedia/commons/ 9/ 99/ Cycle_graph_C4.png") pictureList.kif 11087-11087 Graph circuit is a subclass of graph path
(externalImage GraphCircuit "http://upload.wikimedia.org/wikipedia/commons/ 2/ 24/ C6graph.png") pictureList.kif 11088-11088 Graph circuit is a subclass of graph path

appearance as argument number 2
-------------------------


(termFormat EnglishLanguage GraphCircuit "graph circuit") english_format.kif 1085-1085

antecedent
-------------------------


(=>
    (instance ?GRAPH GraphCircuit)
    (exists (?NODE)
        (and
            (equal
                (BeginNodeFn ?GRAPH) ?NODE)
            (equal
                (EndNodeFn ?GRAPH) ?NODE))))		 Merge.kif 5878-5883 If X is an instance of graph circuit, then there exists Y such that equal the beginning of X, Y, equal the end of X, and Y

consequent
-------------------------


(=>
    (instance ?GRAPH Tree)
    (not
        (exists (?LOOP)
            (and
                (instance ?LOOP GraphCircuit)
                (graphPart ?LOOP ?GRAPH)))))		 Merge.kif 5818-5824 If X is an instance of tree, then there doesn't exist Y such that Y is an instance of graph circuit and Y is a part of X
(=>
    (and
        (equal
            (BeginNodeFn ?GRAPH) ?NODE)
        (equal
            (EndNodeFn ?GRAPH) ?NODE))
    (instance ?GRAPH GraphCircuit))		 Merge.kif 5885-5889 If equal the beginning of X and Y and equal the end of X and Y, then X is an instance of graph circuit


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.0-0a80e6c8 (2026-05-12) is open source software produced by Articulate Software and its partners