There are a number of prolog or similar systems
available in lisp. See a discussion for example
in Norvig's book, Paradigms of AI programming.
This could be done with maxima, but the pattern
matching of algebra is not as simple as matching
of simple strings or trees.
RJF
Nikolaos I. Ioakimidis wrote:
> Dear Colleagues,
>
> Next to my previous message on the Macsyma book by
> Adi Ben-Israel and Robert Gilbert, I recalled that the first
> Editor of the series of this Spinger book, Bruno Buchberger,
> is the project leader of the so interesting Theorema system
>
> http://www.theorema.org/
>
> trying to enhance Mathematica through proving power
> (sufficiently successfully so far). This is useful in several
> areas (including Calculus to some extent).
>
> I have two questions:
>
> 1. Is there any similar or different effort with Maxima (and
> the commercial Macsyma in the past)?
>
> 2. Have there been any attempts to enhance Maxima (and
> Macsyma) with logical programming facilities, mainly Prolog?
> I know in Mathematica there is a Prolog interpreter prepared
> by Roman Maeder at about 1992-1994. What about Maxima?
> It is my personal impression that such a package would
> significantly enhance the power of Maxima. What about similar
> possibilities with Lisp?
>
> Please, be so kind to forgive me for the above two perhaps naive
> questions. I am still a novice in Maxima and I have not studied
> it sufficiently so far.
>
> I would be thankful for any comments on the above two questions
> especially for the second of them, which concerns an "easier" task
> especially for Maxima written in Lisp.
>
> Many thanks and best regards from Patras,
>
> Nikos
>
>
> _______________________________________________
> Maxima mailing list
> Maxima@www.math.utexas.edu
> http://www.math.utexas.edu/mailman/listinfo/maxima