Représentation de phrases

Solutions aux questions de la 1ère page de ce TD/TP.

1. Représentez la phrase "Every car has at least a red wheel"
   (dans chacune des notations indiquées ci-dessous).

   FL without quantifCtxt:  every Car  part:  (a Wheel color: a Red).
   FL with 2 quantifCtxts:  Car part _[every->a ?w]: (Wheel color _[?w->a]: Red).
   FL with Red first:       Red color of _[a<-?w]: Wheel part of _[a ?w <- every]: Car.
   FL-DF with Car first:    Car --part _[every->a ?w]--> Wheel --color _[?w->a]--> Red 
   FL-DF with Wheel first:  Wheel <--part _[a ?w<-every]-- Car
                                |---color _[?w->a]--> Red
   FE:                      every Car has for part a Wheel that has for color a Red.
   
   

2. Représentez la phrase "There is a wheel shared by every car".

   FL without quantifCtxt:  a Wheel part of:  every Car.
   FL with a quantifCtxt:   Wheel part of: Car __[a->every]. 
   FL with Car first:       Car part: Wheel __[every<-a].
   FL-DF with Wheel first:  Wheel --part of _[a->every]--> Car
   FL-DF with Car first:    Car --part _[every<-a]--> Wheel
   FE:                      a Wheel is part of every Car.
   FE:                      there is a Wheel which is part of every Car.
   
   

3. Représentez la phrase "Every red car has at least a wheel".

   FL without quantifCtxt:  every ^(Car color: a Red)  part: a Wheel.
   FL-DF with Car first:    Car --color _[any ^rc ^-> a]--> Red
                              |---part _[every ^rc ->a]--> Wheel
   FE:                      every Car that has for part a Wheel has for color a Red.
   
   

4. Représentez en FL et FL-DF la phrase  "by definition, any man loves Paris and loves at least 3 red hats" (utilisez des relations 'agent', 'object' et 'color' ainsi que les variables ?l1 et ?l2 ; inutile de préfixer les termes).

   FL without quantifCtxt:  any Man  agent of: (a Love  object: Paris),
                                               (a Love  object: (3..* Hat  color: a Red)).
   FL with quantifCtxt:     Man  agent of _[any -> 1..* ?l1, any -> 1..* ?l2]: 
                                  (Love  object _[?l1 -> .]: Paris,
                                         object _[?l2 -> 3..* ?h]: (Hat  color _[?h->a]: Red)
                                  ).
   FL-DF:  Man --agent of _[any-> a ?l1, any->a?l2]--> Love --object _[?l1 -> .]--> Paris
                                                          |---object _[?l->3..* ?h]--> Hat
                                                               Red <--color _[?h->a]---|
   

5. Représentez en FL et KIF la phrase suivante: "in 2012, every man believed that he loved himself" (utilisez les relations 'believer', 'agent' et 'object' ainsi que les variables ?m et ?l ; inutile de préfixer les termes).

   FL without quantifCtxt:  [every Man ?m,  believer of: [?m  agent of: (a Love object: ?m)]
                            ] time: 2012.
   FL with quantifCtxt:  [Man believer of _[every ?m->.]: 
                                 [Man  agent of _[?m ->a ?l]: (Love  object _[?l->?m]: Man)]
                         ] time _[.->.]: 2012.
   FL-DF :  -------------------------------------------------------------------------
            | Man --believer of _[every ?m->.] ---                                  |
            |                                    |                                  |
            |                                    v                                  |--time-->2012
            |  ------------------------------------------------------------------   |
            |  | Man --agent of _[?m ->a ?l]--> Love --object _[?l->?m]--> Man) |   |
            |  ------------------------------------------------------------------   |
            -------------------------------------------------------------------------
   
   KIF:   (time '(forall ((?m Man))
                    (believer '(exists ((?l Love))
                                 (and (agent ?l ?m) (object ?l ?m)) )
                              ?m) )
                2012)