¤p©ó (lessThan)
(lessThan number1 number2) is true just
in case the Quantity number1 is less than the Quantity number2.
Ontology
SUMO / BASE-ONTOLOGYClass(es)
Coordinate term(s)
¥[ªk¨ç¼Æ
¤Ï±¨ç¼Æ
°£ªk¨ç¼Æ
«ü¼Æ¨ç¼Æ
¥¿±¨ç¼Æ
³Ì¤jÈ¨ç¼Æ
³Ì¤pÈ¨ç¼Æ
¼ªk¨ç¼Æ
Ë¼Æ¨ç¼Æ
¾l¼Æ¨ç¼Æ
¾ã¼Æ¨ç¼Æ
´îªk¨ç¼Æ
©·½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
§¹¦¨
¦¸¼Æ
¹Ï³¡¤À
¤j©ó
¤j©ó©Îµ¥©ó
¦³·N¹Ï
¦³§Þ¥©
¦b...´Á¶¡¬°¯u
¶·¨Ï...¬°¯u
¦³Åv¨Ï...¬°¯u
¬}
¦P¤@¤¸¯À
¦ê¦C¤¤
¦bª`·N½d³ò¤¤
¼W¥[¥i¯à©Ê
¿W¥ß©ÎµM²v
©~¦í
§í¨î
ªì©l¤Æ§Ç¦C
¹ê¨Ò
¤º³¡
褂
«D¤Ï®g©ó...
¤j©ó
¤p©ó©Îµ¥©ó
¤è¦¡/±¡ª¬
ª«½è
´ú¶q
ªÅ¶¡¤W±µÄ²
®É¬q¬Û±µ
±¡ºAÄÝ©Ê
³¡¤À«Å|
®É¬q«Å|
Âù¿Ë
°¾§Ç©ó...
³¡¤À¦ì©ó
¸ô®|ªø
¾Ö¦³
¥ý¨M±ø¥ó
Á×§K
¥¿³¡¤À
¯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
lessThan(¼Æ¶q, ¼Æ¶q)
Related WordNet synsets
- less
- smaller in amount or degree: "the less I see of you the better"; "people have lost their heads for less"
See more related synsets on a separate page.
Axioms (21)
¤p©ó ¹ï ¹ê¼Æ ¬O ¤T¤Àªk.
(trichotomizingOn lessThan RealNumber)
¤j©ó ¬O ¤p©ó ªº ˧Ç.
(inverse greaterThan lessThan)
number1 ¤p©ó©Îµ¥©ó number2 if and only if number1 µ¥©ó number2 or number1 ¤p©ó number2.
(<=>
(lessThanOrEqualTo ?NUMBER1 ?NUMBER2)
(or
(equal ?NUMBER1 ?NUMBER2)
(lessThan ?NUMBER1 ?NUMBER2)))
number ¬O t¹ê¼Æ ªº ¹ê¨Ò if and only if number ¤p©ó and number ¬O ¹ê¼Æ ªº ¹ê¨Ò.
(<=>
(instance ?NUMBER NegativeRealNumber)
(and
(lessThan ?NUMBER 0)
(instance ?NUMBER RealNumber)))
rel ¬O ¥þÈÃö«Y ªº ¹ê¨Ò if and only if there exists valence so that rel ¬O Ãö«Y ªº ¹ê¨Ò and rel %&¦³ ½×¤¸(s) valence and - if for all number,element,class holds: if number ¤p©ó valence and rel ªº ½×¤¸ number ¬O class ªº ¹ê¨Ò and element µ¥©ó ""()" ªº ²Ä¤G ¤¸¯À", then element ¬O class ªº ¹ê¨Ò,
- then there exists item so that rel(,item) (¤£) ¦¨¥ßs
.
(<=>
(instance ?REL TotalValuedRelation)
(exists
(?VALENCE)
(and
(instance ?REL Relation)
(valence ?REL ?VALENCE)
(=>
(forall
(?NUMBER ?ELEMENT ?CLASS)
(=>
(and
(lessThan ?NUMBER ?VALENCE)
(domain ?REL ?NUMBER ?CLASS)
(equal
?ELEMENT
(ListOrderFn
(ListFn @ROW)
?NUMBER)))
(instance ?ELEMENT ?CLASS)))
(exists
(?ITEM)
(holds ?REL @ROW ?ITEM))))))
If formula1 (¤£¡^°§Cs) %2 ªº ¥i¯à©Ê and "formula2 ªº ©ÎµM²v" µ¥©ó number1 and formula1 ªº ¾÷²v ¬O formula2 ¦b formula2 ¬°¯uªº±¡ªp¤U , then number2 ¤p©ó number1.
(=>
(and
(decreasesLikelihood ?FORMULA1 ?FORMULA2)
(equal
(ProbabilityFn ?FORMULA2)
?NUMBER1)
(conditionalProbability ?FORMULA1 ?FORMULA2 ?NUMBER2))
(lessThan ?NUMBER2 ?NUMBER1))
- if list ¬O §Ç¦C ªº ¹ê¨Ò,
- then there exists number1 so that there exists item1 so that "list ªº ²Ä¤G ¤¸¯À" µ¥©ó item1 and for all number2 holds: if number2 ¬O ¥¿¾ã¼Æ ªº ¹ê¨Ò and number2 ¤p©ó number1, then there exists item2 so that "list ªº ²Ä¤G ¤¸¯À" µ¥©ó item2
.
(=>
(instance ?LIST List)
(exists
(?NUMBER1)
(exists
(?ITEM1)
(and
(not
(equal
(ListOrderFn ?LIST ?NUMBER1)
?ITEM1))
(forall
(?NUMBER2)
(=>
(and
(instance ?NUMBER2 PositiveInteger)
(lessThan ?NUMBER2 ?NUMBER1))
(exists
(?ITEM2)
(equal
(ListOrderFn ?LIST ?NUMBER2)
?ITEM2))))))))
If "number ªº ¤W" µ¥©ó int, then there doesn't exist ¾ã¼Æ otherint so that otherint ¤j©ó©Îµ¥©ó number and otherint ¤p©ó int.
(=>
(equal
(CeilingFn ?NUMBER)
?INT)
(not
(exists
(?OTHERINT)
(and
(instance ?OTHERINT Integer)
(greaterThanOrEqualTo ?OTHERINT ?NUMBER)
(lessThan ?OTHERINT ?INT)))))
- if " ªº ³Ì¤p¤½¿¼Æ" µ¥©ó number,
- then there doesn't exist less so that less ¤p©ó number and for all element holds: if element ¬O "()" ªº ¤@ ¦¨û, then "less ¨ú¾l¼Æ element" µ¥©ó
.
(=>
(equal
(LeastCommonMultipleFn @ROW)
?NUMBER)
(not
(exists
(?LESS)
(and
(lessThan ?LESS ?NUMBER)
(forall
(?ELEMENT)
(=>
(inList
?ELEMENT
(ListFn @ROW))
(equal
(RemainderFn ?LESS ?ELEMENT)
0)))))))
If "number1 ©M number2 ªº ³Ì¤pÈ " µ¥©ó number, then - number µ¥©ó number1 and number1 ¤p©ó number2
or - number µ¥©ó number2 and number2 ¤p©ó number1
or - number µ¥©ó number1 and number µ¥©ó number2
.
(=>
(equal
(MinFn ?NUMBER1 ?NUMBER2)
?NUMBER)
(or
(and
(equal ?NUMBER ?NUMBER1)
(lessThan ?NUMBER1 ?NUMBER2))
(and
(equal ?NUMBER ?NUMBER2)
(lessThan ?NUMBER2 ?NUMBER1))
(and
(equal ?NUMBER ?NUMBER1)
(equal ?NUMBER ?NUMBER2))))
- if "¾ã¼Æ 1" µ¥©ó number2,
- then
- if "(number1-"³Ì¤j ¾ã¼Æ ¤p©ó ©Î µ¥©ó number1")" ¤p©ó , then number2 µ¥©ó "³Ì¤j ¾ã¼Æ ¤p©ó ©Î µ¥©ó number1"
or - if "(number1-"³Ì¤j ¾ã¼Æ ¤p©ó ©Î µ¥©ó number1")" ¤j©ó©Îµ¥©ó , then number2 µ¥©ó "number1 ªº ¤W"
.
(=>
(equal
(RoundFn ?NUMBER1)
?NUMBER2)
(or
(=>
(lessThan
(SubtractionFn
?NUMBER1
(FloorFn ?NUMBER1))
0.5)
(equal
?NUMBER2
(FloorFn ?NUMBER1)))
(=>
(greaterThanOrEqualTo
(SubtractionFn
?NUMBER1
(FloorFn ?NUMBER1))
0.5)
(equal
?NUMBER2
(CeilingFn ?NUMBER1)))))
If int ¬O ¾ã¼Æ ªº ¹ê¨Ò, then int ¤p©ó "(int+1)".
(=>
(instance ?INT Integer)
(lessThan
?INT
(SuccessorFn ?INT)))
If int1 ¬O ¾ã¼Æ ªº ¹ê¨Ò and int2 ¬O ¾ã¼Æ ªº ¹ê¨Ò, then int1 ¤p©ó int2 or int2 ¤p©ó "(int1+1)".
(=>
(and
(instance ?INT1 Integer)
(instance ?INT2 Integer))
(not
(and
(lessThan ?INT1 ?INT2)
(lessThan
?INT2
(SuccessorFn ?INT1)))))
If int1 ¬O ¾ã¼Æ ªº ¹ê¨Ò and int2 ¬O ¾ã¼Æ ªº ¹ê¨Ò, then int2 ¤p©ó int1 or "(int1+2)" ¤p©ó int2.
(=>
(and
(instance ?INT1 Integer)
(instance ?INT2 Integer))
(not
(and
(lessThan ?INT2 ?INT1)
(lessThan
(PredecessorFn ?INT1)
?INT2))))
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))))
If hour ¬O "¤p®É number" ªº ¹ê¨Ò, then number ¤p©ó .
(=>
(instance
?HOUR
(HourFn ?NUMBER ?DAY))
(lessThan ?NUMBER 24))
If minute ¬O "¤ÀÄÁ number" ªº ¹ê¨Ò, then number ¤p©ó .
(=>
(instance
?MINUTE
(MinuteFn ?NUMBER ?HOUR))
(lessThan ?NUMBER 60))
If second ¬O "¬íÄÁ¨ç¼Æ(number,minute)" ªº ¹ê¨Ò, then number ¤p©ó .
(=>
(instance
?SECOND
(SecondFn ?NUMBER ?MINUTE))
(lessThan ?NUMBER 60))
If decrease ¬O ´î¤Ö ªº ¹ê¨Ò and obj ¬O decrease ªº ¨ü¨ÆªÌ, then there exist unit,quant1,quant2 so that "obj unit(s)" µ¥©ó quant1 ""decrease ¦s¦b ªº ®É¶¡" ¤£¤[ ¤§«e"a(¤§¤¤) "decrease ¦s¦b ªº ®É¶¡" ¤£¤[ ¤§«e and "obj unit(s)" µ¥©ó quant2 ""decrease ¦s¦b ªº ®É¶¡" ¤£¤[ ¤§«á"a(¤§¤¤) "decrease ¦s¦b ªº ®É¶¡" ¤£¤[ ¤§«á and quant2 ¤p©ó quant1.
(=>
(and
(instance ?DECREASE Decreasing)
(patient ?DECREASE ?OBJ))
(exists
(?UNIT ?QUANT1 ?QUANT2)
(and
(holdsDuring
(ImmediatePastFn
(WhenFn ?DECREASE))
(equal
(MeasureFn ?OBJ ?UNIT)
?QUANT1))
(holdsDuring
(ImmediateFutureFn
(WhenFn ?DECREASE))
(equal
(MeasureFn ?OBJ ?UNIT)
?QUANT2))
(lessThan ?QUANT2 ?QUANT1))))
If cool ¬O °·Å ªº ¹ê¨Ò and obj ¬O cool ªº ¨ü¨ÆªÌ, then there exist ·Å«×³æ¦ì unit,quant1,quant2 so that "obj unit(s)" µ¥©ó quant1 ""cool ¦s¦b ªº ®É¶¡" ¤£¤[ ¤§«e"a(¤§¤¤) "cool ¦s¦b ªº ®É¶¡" ¤£¤[ ¤§«e and "obj unit(s)" µ¥©ó quant2 ""cool ¦s¦b ªº ®É¶¡" ¤£¤[ ¤§«á"a(¤§¤¤) "cool ¦s¦b ªº ®É¶¡" ¤£¤[ ¤§«á and quant2 ¤p©ó quant1.
(=>
(and
(instance ?COOL Cooling)
(patient ?COOL ?OBJ))
(exists
(?UNIT ?QUANT1 ?QUANT2)
(and
(instance ?UNIT TemperatureMeasure)
(holdsDuring
(ImmediatePastFn
(WhenFn ?COOL))
(equal
(MeasureFn ?OBJ ?UNIT)
?QUANT1))
(holdsDuring
(ImmediateFutureFn
(WhenFn ?COOL))
(equal
(MeasureFn ?OBJ ?UNIT)
?QUANT2))
(lessThan ?QUANT2 ?QUANT1))))
- if
- path1 ¦ñÀH process µo¥Í ªº process¸ô®|
and - process (¤£) °_·½s ©ó source
and - process (¤£) ²×µ²not(s) dest
and - path1 ªº ªø«× ¬O measure1
and - there don't exist path2,measure2 so that path2 ¦ñÀH process µo¥Í ªº process¸ô®| and process (¤£) °_·½s ©ó origin and process (¤£) ²×µ²not(s) dest and path2 ªº ªø«× ¬O measure2 and measure2 ¤p©ó measure1
, - then for all obj holds: if obj ¬O path1 ªº ³¡¤À), then obj ¤¶©ó source ©M dest ¤¤¶¡
.
(=>
(and
(path ?PROCESS ?PATH1)
(origin ?PROCESS ?SOURCE)
(destination ?PROCESS ?DEST)
(length ?PATH1 ?MEASURE1)
(not
(exists
(?PATH2 ?MEASURE2)
(and
(path ?PROCESS ?PATH2)
(origin ?PROCESS ?ORIGIN)
(destination ?PROCESS ?DEST)
(length ?PATH2 ?MEASURE2)
(lessThan ?MEASURE2 ?MEASURE1)))))
(forall
(?OBJ)
(=>
(part ?OBJ ?PATH1)
(between ?SOURCE ?OBJ ?DEST))))