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

¸ô®|ªø (pathLength)

A BinaryPredicate that specifies the length (in number of GraphNodes) of a GraphPath. (pathLength path number) means that there are number nodes in the GraphPath path.

Ontology

SUMO / GRAPH-THEORY

Class(es)

ºØÃþ
is instance of
  ¥iÄ~©ÓÃö«Y  
is instance of
  ¤G¤¸­zµü  
is instance of
¤£¹ïºÙÃö«Y
is instance of
«D¤Ï¨­Ãö«Y
is instance of

is instance of
  ¸ô®|ªø  

Coordinate term(s)

¤Ï­±¨ç¼Æ  ­p¼Æ¨ç¼Æ  ¥¿­±¨ç¼Æ  ¥DÅé¨ç¼Æ  ©ÎµM²v¨ç¼Æ  ªí¥Ö¨ç¼Æ  ©·½u­«¶q  Äݩʠ §@ªÌ  ¥ý©ó  ¥ý©ó©Î¦P®É  »F¦]  ¦¸Ãþ»F¦]  ¤½¥Á  «Ê³¬©ó  ¶ñº¡  ¬Û³sªº  ¤w³sµ²¤uµ{¤¸¥ó  ¥]§t°T®§  ¦@¥Í  ½Æ»s  ¬Û¥æ  ¤é´Á  ­°§C¥i¯à©Ê  µo®i´Á§Î¦¡  µL¥æ¶°  ¤À°t  ¤å¦r»¡©ú  «ùÄò®É¶¡  ´Á¶¡  ¸û¦­  ½sªÌ  ¤¸¯À  ¶±¥Î  ¬Ûµ¥  µ¥¦PÃö«Y©ó  §Q¥Î  ¥H...»y¨¥ªí¹F  ­±¹ï  ®a±ÚÃö«Y  ¶ñ¥R  §¹¦¨  ¦¸¼Æ  ¹Ï³¡¤À  ¤j©ó  ¤j©ó©Îµ¥©ó  ¦³·N¹Ï  ¦³§Þ¥©  ¦b...´Á¶¡¬°¯u  ¶·¨Ï...¬°¯u  ¦³Åv¨Ï...¬°¯u  ¬}  ¦P¤@¤¸¯À  ª½±µ¹ê¨Ò  ª½±µ¦¸ºØÃþ  ¦ê¦C¤¤  ¦bª`·N½d³ò¤¤  ¼W¥[¥i¯à©Ê  ¿W¥ß©ÎµM²v  ©~¦í  §í¨î  ªì©l¤Æ§Ç¦C  ¹ê¨Ò  ¤º³¡  ­Ë§Ç  «D¤Ï®g©ó...  ¤j©ó  ¤p©ó  ¤p©ó©Îµ¥©ó  ¤è¦¡/±¡ª¬  ª«½è  ´ú¶q  ªÅ¶¡¤W±µÄ²  ®É¬q¬Û±µ  ¦¨­û  ±¡ºAÄݩʠ ³¡¤À­«Å|  ®É¬q­«Å|  Âù¿Ë  °¾§Ç©ó...  ³¡¤À¶ñ¥R  ³¡¤À¦ì©ó  ¬ï¤J  ¾Ö¦³  ¥ý¨M±ø¥ó  Á×§K  ¥¿³¡¤À  ¾A·í¶ñ¥R  ¯S©Ê  ¥Xª©  ½d³ò  ½d³ò¦¸ºØÃþ  ¹ê²{  ´£¤Î  ¤Ï®g©ó...  SUMO¤º³¡¬ÛÃö·§©À  ¥S§Ì©n©f  ¤p©ó  ¶}©l  ¦¸Äݩʠ ¦¸»E¶°  ¦¸¹Ï  ¦¸§Ç¦C  ¦¸²Õ´  ¦¸­pµe  ¦¸¾úµ{  ¦¸©RÃD  ¦¸ºØÃþ  ¦¸Ãö«Y  ¥]§t°T®§ºØÃþ  ¥]§t°T®§¹ê¨Ò  Äò±µÄݩʠ «Ê³¬Äò±µÄݩʠ ¥~ªí³¡¤À  ªí­±  ®É¶¡³¡¤À  ®É¶¡  ¥þ§Ç©ó...  ¤T¤Àªk  ¨Ï¥Î  ¡]µ²¦X¡^»ù  ¤H³yª«ª©¥» 

Type restrictions

pathLength(¹Ï¸ô®|, ¥¿¾ã¼Æ)

Axioms (2)

(=>
      (equal
            (MinimalCutSetFn ?GRAPH)
            ?PATHCLASS)
      (exists
            (?NUMBER)
            (forall
                  (?PATH)
                  (=>
                        (instance ?PATH ?PATHCLASS)
                        (pathLength ?PATH ?NUMBER)))))

There don't exist ¹º¤À graph ¬° ¨â ¿W¥ß ¹Ïªí ªº ¬Û¥æ¸ô®| path1,¹º¤À graph ¬° ¨â ¿W¥ß ¹Ïªí ªº ³Ì¤p¬Û¥æ¸ô®| path2 so that path1 ªº ¸ô®|ªø ¬O number1 and path2 ªº ¸ô®|ªø ¬O number2 and number1 ¤p©ó number2.
(not
      (exists
            (?PATH1 ?PATH2)
            (and
                  (instance
                        ?PATH1
                        (CutSetFn ?GRAPH))
                  (instance
                        ?PATH2
                        (MinimalCutSetFn ?GRAPH))
                  (pathLength ?PATH1 ?NUMBER1)
                  (pathLength ?PATH2 ?NUMBER2)
                  (lessThan ?NUMBER1 ?NUMBER2))))