§Ç¦C¨ç¼Æ (ListFn)
A Function that takes any number of arguments and
returns the List containing those arguments in exactly the same order.
Ontology
SUMO / BASE-ONTOLOGYClass(es)
Coordinate term(s)
«ü©w¨ç¼Æ
³Ì¤j¤½¬ù¼Æ¨ç¼Æ
³Ì¤p¤½¿¼Æ¨ç¼Æ
¥Ù¬ÞÄÝ©Ê
µL¥æ¶°¤À¸Ñ
µL¥æ¶°Ãö«Y
½aºÉªºÄÝ©Ê
½aºÉªº¤À¸Ñ
¦¨¥ß
¤À³Î
Axioms (27)
(=>
(equal ?OBJ1 ?OBJ2)
(=>
(and
(equal
?OBJ1
(ListOrderFn
(ListFn @ROW1)
?NUMBER))
(equal
?OBJ2
(ListOrderFn
(ListFn @ROW2)
?NUMBER))
(equal
(ListFn @ROW1)
(ListFn @ROW2)))
(<=>
(holds @ROW1)
(holds @ROW2))))
- if list1 µ¥©ó list2,
- then if list1 µ¥©ó "()" and list2 µ¥©ó "()", then for all number holds: ""()" ªº ²Ä¤G ¤¸¯À" µ¥©ó ""()" ªº ²Ä¤G ¤¸¯À"
.
(=>
(equal ?LIST1 ?LIST2)
(=>
(and
(equal
?LIST1
(ListFn @ROW1))
(equal
?LIST2
(ListFn @ROW2)))
(forall
(?NUMBER)
(equal
(ListOrderFn
(ListFn @ROW1)
?NUMBER)
(ListOrderFn
(ListFn @ROW2)
?NUMBER)))))
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 ¹ï¥ß©ó ?,
- then for all attr1,attr2 holds:
- if attr1 µ¥©ó ""()" ªº ²Ä¤G ¤¸¯À" and attr2 µ¥©ó ""()" ªº ²Ä¤G ¤¸¯À" and number1 µ¥©ó number2,
- then if obj ¦³ ÄÝ©Ê attr1, then obj ¦³ ÄÝ©Ê attr2
.
(=>
(contraryAttribute @ROW)
(forall
(?ATTR1 ?ATTR2)
(=>
(and
(equal
?ATTR1
(ListOrderFn
(ListFn @ROW)
?NUMBER1))
(equal
?ATTR2
(ListOrderFn
(ListFn @ROW)
?NUMBER2))
(not
(equal ?NUMBER1 ?NUMBER2)))
(=>
(property ?OBJ ?ATTR1)
(not
(property ?OBJ ?ATTR2))))))
- 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)))
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 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))
- 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))))
If rel ªº ½×¤¸ number ¬O class ªº ¹ê¨Ò and rel() (¤£) ¦¨¥ßs, then ""()" ªº ²Ä¤G ¤¸¯À" ¬O class ªº ¹ê¨Ò.
(=>
(and
(domain ?REL ?NUMBER ?CLASS)
(holds ?REL @ROW))
(instance
(ListOrderFn
(ListFn @ROW)
?NUMBER)
?CLASS))
If rel ªº ½×¤¸ number ¬O class ªº ¦¸ºØÃþ and rel() (¤£) ¦¨¥ßs, then ""()" ªº ²Ä¤G ¤¸¯À" ¬O class ªº ¦¸ºØÃþ.
(=>
(and
(domainSubclass ?REL ?NUMBER ?CLASS)
(holds ?REL @ROW))
(subclass
(ListOrderFn
(ListFn @ROW)
?NUMBER)
?CLASS))
""(,item)" ªº ªø«×" µ¥©ó "(""()" ªº ªø«×"+1)".
(equal
(ListLengthFn
(ListFn @ROW ?ITEM))
(SuccessorFn
(ListLengthFn
(ListFn @ROW))))
""(,item)" ªº ²Ä¤G ¤¸¯À" µ¥©ó item.
(equal
(ListOrderFn
(ListFn @ROW ?ITEM)
(ListLengthFn
(ListFn @ROW ?ITEM)))
?ITEM)
- if rel %&¦³ ½×¤¸(s) number,
- then for all holds: if rel() (¤£) ¦¨¥ßs, then ""()" ªº ªø«×" µ¥©ó number
.
(=>
(valence ?REL ?NUMBER)
(forall
(@ROW)
(=>
(holds ?REL @ROW)
(equal
(ListLengthFn
(ListFn @ROW))
?NUMBER))))
"()" (¨S¡^ªì©l¤Ænot(s) "(,item)".
(initialList
(ListFn @ROW)
(ListFn @ROW ?ITEM))
(=>
(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)))