- Mail actions: [ respond to this message ] [ mail a new topic ]
- Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ] [ by messages with attachments ]

From: Alexandre Saidi <Alexandre.Saidi_at_...37...>

Date: Tue, 06 Feb 2007 18:54:07 +0100

Received on Tue Feb 06 2007 - 18:03:40 CET

Date: Tue, 06 Feb 2007 18:54:07 +0100

Hi, Some Prologs are suited : P3 or P4 This is not really the answer, but may help. - When you submit the following expression to a logical system (like PIII), you get the "normal" behavier: P=>Q & P=>R - and if you constrain the following equivalence P => (Q & R) = (P => Q) & (Q => R) you get : P | R = true. ((P or R) must be true) - An example : "it rains => cloudy & wet". but not "cloudsy=> wet" ? Cheers. Alex phiroc_at_...22... a écrit : >Hello, > >In "Logical Reasoning: A First Course", there is an exercise in which you are >supposed to test whether P ==> ( Q /\ R) is equivalent to ( P ==> Q ) /\ ( Q ==> >R ) > >I have manually computed the truth table and would like to check my results with >a computer. > >Is there a way to check such an equivalence in ECLiPSe or is Prolog not suited >for such boolean operations? > >Many thanks. > >phiroc > > >_______________________________________________ >ECLiPSe-Users mailing list >ECLiPSe-Users_at_...2... >http://www.crosscoreop.com/mailman/listinfo/eclipse-users > > > -- Aleksander S. Saidi Maître de Conférences Ecole Centrale de Lyon Département Mathématiques-Informatique Mél : Alexandre.Saidi_at_...37... Tél : 04.72.18.65.30, Fax : 04.78.33.16.15

- text/x-vcard attachment: Alexandre.Saidi.vcf

*
This archive was generated by hypermail 2.3.0
: Mon Aug 26 2019 - 06:14:56 CEST
*