initial node fn (InitialNodeFn)

A UnaryFunction that maps a GraphArc to the initial node of the GraphArc. Note that this is a partial function. In particular, the function is undefined for GraphArcs that are not part of a DirectedGraph.

Ontology

SUMO / GRAPH-THEORY

Class(es)

Classe

inheritable relation

FunzioneUnaria

initial node fn

Coordinate term(s)

absolute value fn abstraction fn arc cosine fn arc sine fn arc tangent fn back fn begin fn begin node fn cardinality fn ceiling fn complement fn cosine fn cut set fn denominator fn end fn end node fn extension fn floor fn front fn future fn generalized intersection fn generalized union fn giga fn imaginary part fn immediate future fn immediate past fn integer square root fn kilo fn list length fn magnitude fn mega fn micro fn milli fn minimal cut set fn nano fn numerator fn organization fn past fn path weight fn pico fn power set fn predecessor fn principal host fn probability fn property fn rational number fn real number fn reciprocal fn round fn signum fn sine fn skin fn square root fn successor fn tangent fn tera fn terminal node fn wealth fn when fn year fn

Type restrictions

NodoDelGrafo InitialNodeFn(ArcoDelGrafo)

Axioms (4)

Se graph é un' istanza di GrafoDiretto e arc é un' istanza di ArcoDelGrafo e arc é una parte di graph, allora esiste node1,node2 tale che "il nodo iniziale di arc" is uguale a node1 e "il nodo terminale di arc" is uguale a node2.

(=>
      (and
            (instance ?GRAPH DirectedGraph)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (exists
            (?NODE1 ?NODE2)
            (and
                  (equal
                        (InitialNodeFn ?ARC)
                        ?NODE1)
                  (equal
                        (TerminalNodeFn ?ARC)
                        ?NODE2))))

se graph é un' istanza di CamminoDelGrafo e arc é un' istanza di ArcoDelGrafo e arc é una parte di graph,
allora se "il nodo iniziale di arc" is uguale a node, allora non esiste other tale che "il nodo iniziale di other" is uguale a node e other is not uguale a arc

(=>
      (and
            (instance ?GRAPH GraphPath)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (=>
            (equal
                  (InitialNodeFn ?ARC)
                  ?NODE)
            (not
                  (exists
                        (?OTHER)
                        (and
                              (equal
                                    (InitialNodeFn ?OTHER)
                                    ?NODE)
                              (not
                                    (equal ?OTHER ?ARC)))))))

Se "il nodo iniziale di arc" is uguale a node e "il nodo terminale di arc" is uguale a node, allora arc é un' istanza di GrafoCiclico.

(=>
      (and
            (equal
                  (InitialNodeFn ?ARC)
                  ?NODE)
            (equal
                  (TerminalNodeFn ?ARC)
                  ?NODE))
      (instance ?ARC GraphLoop))

begin node fn é interamente correlato a initial node fn.

(relatedInternalConcept BeginNodeFn InitialNodeFn)