> Q.4. Write a code that will output a logically equivalent clause
> or clauses, given a sentence of the form M --> N, where M
> is a pure conjunction or disjunction and N is also a pure conjunction
> or disjunction. The output in CNF should be equivalent to M --> N.
There are 4 cases like the ones below:
(1) (a AND b AND c) --> (m OR n)
(2) (a AND b AND c) --> (m AND n)
(3) (a OR b OR c) --> (m OR n)
(4) (a OR b OR c) --> (m AND n)
In article
<····································@e1g2000hsh.googlegroups.com>,
·············@gmail.com wrote:
> > Q.4. Write a code that will output a logically equivalent clause
> > or clauses, given a sentence of the form M --> N, where M
> > is a pure conjunction or disjunction and N is also a pure conjunction
> > or disjunction. The output in CNF should be equivalent to M --> N.
>
> There are 4 cases like the ones below:
>
> (1) (a AND b AND c) --> (m OR n)
> (2) (a AND b AND c) --> (m AND n)
> (3) (a OR b OR c) --> (m OR n)
> (4) (a OR b OR c) --> (m AND n)
Again homework?
--
http://lispm.dyndns.org/
On Nov 20, 8:56 am, Rainer Joswig <······@lisp.de> wrote:
> In article
> <····································@e1g2000hsh.googlegroups.com>,
>
> ·············@gmail.com wrote:
> > > Q.4. Write a code that will output a logically equivalent clause
> > > or clauses, given a sentence of the form M --> N, where M
> > > is a pure conjunction or disjunction and N is also a pure conjunction
> > > or disjunction. The output in CNF should be equivalent to M --> N.
>
> > There are 4 cases like the ones below:
>
> > (1) (a AND b AND c) --> (m OR n)
> > (2) (a AND b AND c) --> (m AND n)
> > (3) (a OR b OR c) --> (m OR n)
> > (4) (a OR b OR c) --> (m AND n)
>
> Again homework?
>
> --http://lispm.dyndns.org/
Nice website by the way....