Select language: english | cesky | deutsch | italiano | simplified chinese | traditional chinese | hindi
Concept:
English word:
Home

¸ô®|¶q¨ç¼Æ (PathWeightFn)

A UnaryFunction that maps a GraphPath to the sum of the arcWeights on the GraphArcs in the GraphPath.

Ontology

SUMO / GRAPH-THEORY

Class(es)

ºØÃþ
is instance of
  ¥iÄ~©ÓÃö«Y  
is instance of
  ¤@¤¸¨ç¼Æ  
is instance of
  ¸ô®|¶q¨ç¼Æ  

Coordinate term(s)

µ´¹ï­È¨ç¼Æ  ´y­z¨ç¼Æ  ©·¾l©¶  ©·¥¿©¶  ©·¥¿¤Á  ¤Ï­±¨ç¼Æ  ¡]®É¶¡¡^¶}©l¨ç¼Æ  ³Ìªì¸`ÂI¨ç¼Æ  ­p¼Æ¨ç¼Æ  ¤W­­¨ç¼Æ  ¤¬¸É¨ç¼Æ  ¾l©¶¨ç¼Æ  ¬Û¥æ¸ô®|¨ç¼Æ  ³æ¦ì¨ç¼Æ  ¡]®É¶¡¡^µ²§ô¨ç¦¡  ³Ì«á¸`ÂI¨ç¼Æ  ½d³ò¨ç¼Æ  ¤U­­¨ç¼Æ  ¥¿­±¨ç¼Æ  ¡]®É¶¡¡^¥¼¨Ó¨ç¦¡  ·§¤Æ¨ç¼Æ  ·§¤ÆÁp¶°¨ç¼Æ  ¤Q»õ­p¨ç¼Æ  µê¼Æ¨ç¼Æ  ³Ìªñ¥¼¨Ó®É¶¡¨ç¼Æ  ³Ìªñ¹L¥h®É¶¡¨ç¼Æ  °_©l¸`ÂI¨ç¼Æ  ¾ã¼Æ¥­¤è®Ú¨ç¼Æ  ¤d­p¨ç¼Æ  ¦Cªø¨ç¼Æ  ¯Å¼Æ¨ç¼Æ  ¦Ê¸U­p¨ç¼Æ  ¦Ê¸U¤À¤§¤@­p¨ç¼Æ  ¤d¤À¤§¤@­p¨ç¼Æ  ³Ì¤p¬Û¥æ¸ô®|¨ç¼Æ  ©`¦Ì¨ç¼Æ  ¤À¤l¨ç¼Æ  ²Õ´¨ç¼Æ  ¹L¥h®É¶¡¨ç¦¡  ¥ü¤À¤§¤@­p¨ç¼Æ  ¾­¶°¦X¨ç¼Æ  «e¼Æ¨ç¼Æ  ¥DÅé¨ç¼Æ  ©ÎµM²v¨ç¼Æ  ¯S©Ê¨ç¼Æ  ¦³²z¼Æ¨ç¼Æ  ¹ê¼Æ¨ç¼Æ  ­Ë¼Æ¨ç¼Æ  ¾ã¼Æ¨ç¼Æ  ¥¿­t¸¹¨ç¼Æ  ¥¿©¶¨ç¼Æ  ªí¥Ö¨ç¼Æ  ¥­¤è®Ú¨ç¼Æ  «á¼Æ¨ç¼Æ  ¥¿¤Á¨ç¼Æ  ¥ü­p¨ç¼Æ  ²×¸`ÂI¨ç¼Æ  °]²£¨ç¼Æ  ¦s¦b®É¶¡¨ç¼Æ  ¦~¥÷¨ç¼Æ 

Type restrictions

¹ê¼Æ PathWeightFn(¹Ï¸ô®|)

Axioms (4)

(=>
      (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)))

(=>
      (and
            (equal
                  (PathWeightFn ?PATH)
                  ?SUM)
            (graphPart ?ARC1 ?PATH)
            (graphPart ?ARC2 ?PATH)
            (arcWeight ?ARC1 ?NUMBER1)
            (arcWeight ?ARC2 ?NUMBER2)
            (forall
                  (?ARC3)
                  (=>
                        (graphPart ?ARC3 ?PATH)
                        (or
                              (equal ?ARC3 ?ARC1)
                              (equal ?ARC3 ?ARC2)))))
      (equal
            (PathWeightFn ?PATH)
            (AdditionFn ?NUMBER1 ?NUMBER2)))

(=>
      (and
            (equal
                  (MinimalWeightedPathFn ?NODE1 ?NODE2)
                  ?PATH)
            (equal
                  (PathWeightFn ?PATH)
                  ?NUMBER))
      (forall
            (?PATH2)
            (=>
                  (and
                        (instance
                              ?PATH2
                              (GraphPathFn ?NODE1 ?NODE2))
                        (equal
                              (PathWeightFn ?PATH2)
                              ?NUMBER2))
                  (greaterThanOrEqualTo ?NUMBER2 ?NUMBER1))))

(=>
      (and
            (equal
                  (MaximalWeightedPathFn ?NODE1 ?NODE2)
                  ?PATH)
            (equal
                  (PathWeightFn ?PATH)
                  ?NUMBER))
      (forall
            (?PATH2)
            (=>
                  (and
                        (instance
                              ?PATH2
                              (GraphPathFn ?NODE1 ?NODE2))
                        (equal
                              (PathWeightFn ?PATH2)
                              ?NUMBER2))
                  (lessThanOrEqualTo ?NUMBER2 ?NUMBER1))))