Exo 1. Ordonnez les phrases suivantes dans une hiérarchie de spécialisation/implication
et reliez les par toutes leurs relations d'implication (=>) et d'exclusion ("£") non déductible.
[5 relations ? 0,25 point par relation entièrement correcte]
A: `there are exactly 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 exactly 50 cat that have for part 2 paw'
Voici un exemple de réponse fausse (partiellement ou totalement) mais dont le format est
correct. Utilisez les lettres ou les phrases entières (chacune sur 1, 2 ou 3 lignes), comme
vous voulez. Utilisez ⇗, ⇑ ou ⇖, pas ⇒, ⇘, ⇓, ⇙, ⇐.
A
⇑
B
⇗ ⇑ ⇖
C £ D E
Les relations du graphe ci-dessous sont elles valides ?
`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 `every 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, "every" 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
Supposez tout d'abord que la BC ne contient pas d'autres graphes|formules|relations
que celles ci-dessous.
Avec cette BC, un moteur d'inférences (purement logique, aussi puissant que vous le souhaitez)
va t-il pouvoir générer les relations d'implication du graphe ci-dessous ?
Va t-il pouvoit générer d'autres relations d'implication ou d'exclusion entre les phrases de ce graphe ?
Pour chacune de ces deux questions, est-ce que l'ajout de certaines relations|formules|règles
dans la BC va changer la réponse ? Si oui, quelles sont ces relations ?
`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.