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



KB Term:  Term intersection
English Word: 

  Tree

Sigma KEE - Tree
Tree(tree)
cladogram, stemma, tree, tree_diagram

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


(subclass Tree DirectedGraph) Merge.kif 5805-5805 Tree is a subclass of directed graph
(documentation Tree EnglishLanguage "A Tree is a DirectedGraph that has no GraphLoops.") Merge.kif 5807-5808 Tree is a subclass of directed graph
(externalImage Tree "http://upload.wikimedia.org/wikipedia/commons/0/08/ Directed_acyclic_graph.png") pictureList.kif 2042-2042 Tree is a subclass of directed graph
(externalImage Tree "http://upload.wikimedia.org/wikipedia/commons/2/24/ Tree_graph.svg") pictureList.kif 2411-2411 Tree is a subclass of directed graph
(externalImage Tree "http://upload.wikimedia.org/wikipedia/commons/b/bf/ Undirected.svg") pictureList.kif 2412-2412 Tree is a subclass of directed graph
(externalImage Tree "http://upload.wikimedia.org/wikipedia/commons/a/a2/ Directed.svg") pictureList.kif 2413-2413 Tree is a subclass of directed graph

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


(termFormat EnglishLanguage Tree "tree") english_format.kif 1081-1081

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


(=>
    (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 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
(=>
    (instance ?GRAPH Tree)
    (not
        (exists (?ARC1 ?ARC2 ?NODE)
            (and
                (graphPart ?ARC1 ?GRAPH)
                (graphPart ?ARC2 ?GRAPH)
                (graphPart ?NODE ?GRAPH)
                (equal
                    (TerminalNodeFn ?ARC1) ?NODE)
                (equal
                    (TerminalNodeFn ?ARC2) ?NODE)
                (not
                    (equal ?ARC1 ?ARC2))))))
Merge.kif 5826-5836 If X is an instance of tree, then All of the following hold: (1) there don't exist Y, Z (2) W such that Y is a part of X (3) Z is a part of X (4) W is a part of X (5) equal the terminal node of Y (6) W (7) equal the terminal node of Z (8) W (9) equal Y (10) Z

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


(=>
    (instance ?O Orchard)
    (exists (?A ?T)
        (and
            (instance ?A Agriculture)
            (located ?A ?O)
            (instance ?T Tree)
            (result ?A ?T))))
Food.kif 3694-3701 If X is an instance of orchard, then there exist Y, Z such that Y is an instance of agriculture, Y is located at X, Z is an instance of tree, and Z is a result of Y


Show simplified definition (without tree view)
Show simplified definition (with tree view)

Show without tree


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