Exo 1. Reliez les phrases suivantes par toutes leurs relations (non déductibles)
[5 relations ? 0,25 point par relation entièrement correcte]
A: `there are 60 cat that have for part 2 ^(paw that has for color a white)'
B: `there are at least 60 cat that have for part 2 paw'
C: `there are at least 50 cat that have for part 2 paw'
D: `there is a cat'
E: `there are 50 cat that have for part 2 paw' (exactly 50)
D:`there is a cat'
⇑
C:`there are at least 50 cat
that have for part 2 paw'
⇗ ⇑
E:`there are 50 cat that £ B:`there are at least 60 cat that
have for part 2 paw' have for part 2 paw'
⇑
A:`there are 60 cat
that have for part 2
^(paw that has for color a white)'
Toutes les relations du graphe ci-dessous sont valides mais celle partant de "each" n'est pas
valide lorsque "each" est remplacé par "every" (comme c'était le cas dans le graphe initial)
car – contrairement à "each"|"100%" – "every" ne spécialise pas "at least 50%".
`no Animal can be agent of a Process´
£ £
`at least 1 Bird ⇐ `at least 50% of Bird
can be agent of can be agent of
a Flight´ a Flight´
⇑ ⇖ ⇖
`1 Bird `Tweety can be `each Bird
can be agent of a Flight can be
agent of that has for duration agent of
a Flight´ at least 0.5 Hour´ a Flight´
⇑
`Tweety is agent of a Flight that
has for duration at least 0.5 Hour´
Legend. £: exclusion; ⇒: implication; every sentence is in FE;
relation types are in italics; concept types begin by an uppercase;
the authors of terms, sentences and relations are not represented;
in FE, "each" and "%" are for "observations" and imply "at least 1",
whereas "any" is for "definitions" and does not imply "at least 1";
the distinction is important since observations can be false
while definitions cannot (← agents can give any identifier they want
to the types they create) and thus cannot be corrected or contradicted ;
"every" is a supertype of "each" and "any".
Les deux relations d'implication du graphe ci-dessous sont générables par un moteur d'inférence si
Si les points ci-dessus sont vérifiés (ou s'ils ne le sont pas et que le moteur
d'inférences ne travaille ni avec
l'hypothèse du monde clos ni avec le Unique name assumption), il n'y a aucune relation d'exclusion dans
le graphe ci-dessous.
Notez aussi que : ` `^x !=> ^y' !=> `^x =>! ^y' ' et que
` `^x =>! ^y' <=> `^x !-<= ^y' '.
Dans tous les cas, la phrase `a Double_room Hotel_room ...' ne généralise pas et n'implique pas
la phrase
`an Hotel_room ...' à cause de la relation/précision
"... with part Free Wifi" dans cette seconde phrase.
Il n'y a pas non plus d'implication dans l'autre sens (ni de généralisation ;
rappel : l'implication et la
généraliation vont de pair entre formules existentielles conjonctives).
`a Lodging with place La_Réunion´
⇗ ⇖
`a Double_room Hotel_room `an Hotel_room
with part 2 Bed, with part at least 2 Bed,
with place the Hotel_Mercure with part Free Wifi,
that has for name "Créolia" and with name a Regular_expression "*a",
that has for place with place
Sainte-Clotilde, and Saint-Denis_de_La_Réunion and
with cost 69$ per Night´ with cost at most 100$ per Night´
Legend: same as in the previous page.