Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!ukma!uunet!mcvax!dlt1!szulc
From: szulc@dlt1.UUCP
Newsgroups: comp.lang.prolog,sci.math.symbolic
Subject: Algebraic simplification algorythm wanted.
Message-ID: <461@dlt1.uucp>
Date: Fri, 2-Oct-87 06:07:36 EDT
Article-I.D.: dlt1.461
Posted: Fri Oct  2 06:07:36 1987
Date-Received: Sat, 3-Oct-87 12:13:58 EDT
Reply-To: szulc@dlt1.UUCP (Eddy Szulc)
Distribution: world
Organization: BSO/Research, Utrecht, Holland
Lines: 8
Keywords: symbolic algebra prolog
Xref: utgpu comp.lang.prolog:348 sci.math.symbolic:150

Algebraic simplification algorythm wanted.

I'm looking for an algorythm, preferably in Prolog, for simplifying
an algebraic expression. My first attempts can handle expressions
of the form 2+a+3 => 5+a, but gets lost with 2+a+3+b+4. I know that
I could flatten the trees, sort them and then re-construct them,
but I need something that works for all sorts of operators and that
can be defined by simple rules.