From: Peter Pui Tak Chiu
Subject: Simplification
Date: Sat, 25 Jul 1992 11:54:10 +0000
Message-ID: <1992Jul25.115410.27207@wuecl.wustl.edu>

hi everyone,

i have a real naive question:

        how to do symbolic simplification using scheme, lisp or anything...?

what i mean is symbolic simplification like MATHEMATICA.

here are some examples:

          (* a (+ b (/ c a))) ==> (+ (* a b) c)
          (+ (* a b) (* a c)) ==> (* a (+ b c))

these are just very simple cases and are intended to explain what i mean...
i want to know a way to find the "simplest form" of any algebric expression.
not only those which are as simple as the above.

can anyone tell me how to do it or refer me to some books that talk about it?

thanks in advance

peter

From: Ulrich Schaefer
Subject: Re: Simplification
Date: Mon, 27 Jul 1992 10:43:39 +0000
Message-ID: <SCHAEFER.92Jul27124410@disco-sol.dfki.uni-sb.de>

In article <······················@wuecl.wustl.edu> ····@cec1.wustl.edu (Peter Pui Tak Chiu) writes:

	   how to do symbolic simplification using scheme, lisp or anything...?

   what i mean is symbolic simplification like MATHEMATICA.
[...]
   can anyone tell me how to do it or refer me to some books that talk about it?

I guess the following book will be very useful.

%A Peter Norvig
%T Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp
%I San Mateo: California: Morgan Kaufmann
%D 1991
%O ISBN 1-55860-191-0

--
   __o     /  / /        /     __    /        /       ········@dfki.uni-sb.de
 _ \<,_   /  / / __ o _ /_    (   _ /_  o_o _/_ _  _  Phone ++49-681-3025303
(_)/ (_) /__/_/_/(_(_(_/ (   __)_(_/ (_(_/__/__(/_/(  Home  ++49-681-54921
-------------------------------------------/---------------------------------
Ulrich Schaefer, Deutschherrnstrasse 27, D-6600 Saarbruecken 1, Germany
"Ich, Fahrradfahren? Bei *dem* Verkehr?"