¦ê¦C¤¤ (inList)
The analog of element and instance for Lists.
(inList obj list) means that obj is in the List list. For example,
(inList Tuesday (ListFn Monday Tuesday Wednesday)) would be true.
Ontology
SUMO / BASE-ONTOLOGYClass(es)
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¤@¤¸¯À
ª½±µ¹ê¨Ò
ª½±µ¦¸ºØÃþ
¦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
inList(¹êÅé, §Ç¦C)
Related WordNet synsets
- listed
- on a list
See more related synsets on a separate page.
Axioms (21)
If µL¥æ¶°Ãö«Y() holds and rel ¬O "()" ªº ¤@ ¦¨û, then rel ¬O Ãö«Y ªº ¹ê¨Ò.
(=>
(and
(disjointRelation @ROW)
(inList
?REL
(ListFn @ROW)))
(instance ?REL Relation))
If µL¥æ¶°Ãö«Y() holds and rel1 ¬O "()" ªº ¤@ ¦¨û and rel2 ¬O "()" ªº ¤@ ¦¨û and rel1 %&¦³ ½×¤¸(s) number, then rel2 %&¦³ ½×¤¸(s) number.
(=>
(and
(disjointRelation @ROW)
(inList
?REL1
(ListFn @ROW))
(inList
?REL2
(ListFn @ROW))
(valence ?REL1 ?NUMBER))
(valence ?REL2 ?NUMBER))
If µL¥æ¶°Ãö«Y() holds and rel1 ¬O "()" ªº ¤@ ¦¨û and rel2 ¬O "()" ªº ¤@ ¦¨û and rel1 µ¥©ó rel2 and rel1() (¤£) ¦¨¥ßs, then rel2() not(¤£) ¦¨¥ß.
(=>
(and
(disjointRelation @ROW1)
(inList
?REL1
(ListFn @ROW1))
(inList
?REL2
(ListFn @ROW1))
(not
(equal ?REL1 ?REL2))
(holds ?REL1 @ROW2))
(not
(holds ?REL2 @ROW2)))
(=>
(contraryAttribute @ROW)
(=>
(inList
?ELEMENT
(ListFn @ROW))
(instance ?ELEMENT Attribute)))
- if ½aºÉªºÄÝ©Ê,
- then if attr ¬O "()" ªº ¤@ ¦¨û, then attr ¬O ÄÝ©Ê ªº ¹ê¨Ò
.
(=>
(exhaustiveAttribute ?CLASS @ROW)
(=>
(inList
?ATTR
(ListFn @ROW))
(instance ?ATTR Attribute)))
- if ½aºÉªºÄÝ©Ê,
- then for all obj holds: if attr1 ¬O class ªº ¹ê¨Ò, then there exists attr2 so that attr2 ¬O "()" ªº ¤@ ¦¨û and attr1 µ¥©ó attr2
.
(=>
(exhaustiveAttribute ?CLASS @ROW)
(forall
(?OBJ)
(=>
(instance ?ATTR1 ?CLASS)
(exists
(?ATTR2)
(and
(inList
?ATTR2
(ListFn @ROW))
(equal ?ATTR1 ?ATTR2))))))
- if ³Q ¥]§t,
- then if element ¬O "()" ªº ¤@ ¦¨û, then element ¬O ºØÃþ ªº ¹ê¨Ò
.
(=>
(exhaustiveDecomposition @ROW)
(=>
(inList
?ELEMENT
(ListFn @ROW))
(instance ?ELEMENT Class)))
(=>
(disjointDecomposition @ROW)
(=>
(inList
?ELEMENT
(ListFn @ROW))
(instance ?ELEMENT Class)))
If rel ¬O ·N¹ÏÃö«Y ªº ¹ê¨Ò and rel(agent,) (¤£) ¦¨¥ßs and obj ¬O "()" ªº ¤@ ¦¨û, then agent ¦b obj ½d³ò¤¤.
(=>
(and
(instance ?REL IntentionalRelation)
(holds ?REL ?AGENT @ROW)
(inList
?OBJ
(ListFn @ROW)))
(inScopeOfInterest ?AGENT ?OBJ))
list µ¥©ó ªÅ¦C if and only if there doesn't exist item so that item ¬O list ªº ¤@ ¦¨û.
(<=>
(equal ?LIST NullList)
(not
(exists
(?ITEM)
(inList ?ITEM ?LIST))))
- if class ³Q ¥]§t,
- then for all obj holds: if obj ¬O class ªº ¹ê¨Ò, then there exists item so that item ¬O "()" ªº ¤@ ¦¨û and obj ¬O item ªº ¹ê¨Ò
.
(=>
(exhaustiveDecomposition ?CLASS @ROW)
(forall
(?OBJ)
(=>
(instance ?OBJ ?CLASS)
(exists
(?ITEM)
(and
(inList
?ITEM
(ListFn @ROW))
(instance ?OBJ ?ITEM))))))
- if class µL¥æ¶°¦a ¤À¸Ñ¦¨ ,
- then for all item holds: if item ¬O "()" ªº ¤@ ¦¨û, then item ¬O class ªº ¦¸ºØÃþ
.
(=>
(disjointDecomposition ?CLASS @ROW)
(forall
(?ITEM)
(=>
(inList
?ITEM
(ListFn @ROW))
(subclass ?ITEM ?CLASS))))
- if class µL¥æ¶°¦a ¤À¸Ñ¦¨ ,
- then for all item1,item2 holds: if item1 ¬O "()" ªº ¤@ ¦¨û and item2 ¬O "()" ªº ¤@ ¦¨û and item1 µ¥©ó item2, then item1 µL¥æ¶° ©ó item2
.
(=>
(disjointDecomposition ?CLASS @ROW)
(forall
(?ITEM1 ?ITEM2)
(=>
(and
(inList
?ITEM1
(ListFn @ROW))
(inList
?ITEM2
(ListFn @ROW))
(not
(equal ?ITEM1 ?ITEM2)))
(disjoint ?ITEM1 ?ITEM2))))
item ¬O list ªº ¤@ ¦¨û if and only if there exists number so that "list ªº ²Ä¤G ¤¸¯À" µ¥©ó item.
(<=>
(inList ?ITEM ?LIST)
(exists
(?NUMBER)
(equal
(ListOrderFn ?LIST ?NUMBER)
?ITEM)))
- if list1 ¬O list2 ªº ¦¸§Ç¦C,
- then for all item holds: if item ¬O list1 ªº ¤@ ¦¨û, then item ¬O list2 ªº ¤@ ¦¨û
.
(=>
(subList ?LIST1 ?LIST2)
(forall
(?ITEM)
(=>
(inList ?ITEM ?LIST1)
(inList ?ITEM ?LIST2))))
- if list1 ¬O list2 ªº ¦¸§Ç¦C,
- then there exists number3 so that for all item holds: if item ¬O list1 ªº ¤@ ¦¨û, then there exist number1,number2 so that "list1 ªº ²Ä¤G ¤¸¯À" µ¥©ó item and "list2 ªº ²Ä¤G ¤¸¯À" µ¥©ó item and number2 µ¥©ó "(number1+number3)"
.
(=>
(subList ?LIST1 ?LIST2)
(exists
(?NUMBER3)
(forall
(?ITEM)
(=>
(inList ?ITEM ?LIST1)
(exists
(?NUMBER1 ?NUMBER2)
(and
(equal
(ListOrderFn ?LIST1 ?NUMBER1)
?ITEM)
(equal
(ListOrderFn ?LIST2 ?NUMBER2)
?ITEM)
(equal
?NUMBER2
(AdditionFn ?NUMBER1 ?NUMBER3))))))))
(=>
(equal
(GreatestCommonDivisorFn @ROW)
?NUMBER)
(forall
(?ELEMENT)
(=>
(inList
?ELEMENT
(ListFn @ROW))
(equal
(RemainderFn ?ELEMENT ?NUMBER)
0))))
- if " ªº ³Ì¤j¤½¬ù¼Æ" µ¥©ó number,
- then there doesn't exist greater so that greater (¤£) ¤j©ó number and for all element holds: if element ¬O "()" ªº ¤@ ¦¨û, then "element ¨ú¾l¼Æ greater" µ¥©ó
.
(=>
(equal
(GreatestCommonDivisorFn @ROW)
?NUMBER)
(not
(exists
(?GREATER)
(and
(greaterThan ?GREATER ?NUMBER)
(forall
(?ELEMENT)
(=>
(inList
?ELEMENT
(ListFn @ROW))
(equal
(RemainderFn ?ELEMENT ?GREATER)
0)))))))
(=>
(equal
(LeastCommonMultipleFn @ROW)
?NUMBER)
(forall
(?ELEMENT)
(=>
(inList
?ELEMENT
(ListFn @ROW))
(equal
(RemainderFn ?NUMBER ?ELEMENT)
0))))
- 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 obj1 ¹ï obj2 ¬O attr1 and ¹ï¥ß©ó ? and attr1 ¬O "()" ªº ¤@ ¦¨û and attr2 ¬O "()" ªº ¤@ ¦¨û and attr1 µ¥©ó attr2, then obj1 ¹ï obj2 ¬O not attr2.
(=>
(and
(orientation ?OBJ1 ?OBJ2 ?ATTR1)
(contraryAttribute @ROW)
(inList
?ATTR1
(ListFn @ROW))
(inList
?ATTR2
(ListFn @ROW))
(not
(equal ?ATTR1 ?ATTR2)))
(not
(orientation ?OBJ1 ?OBJ2 ?ATTR2)))