Home > Archive > Prolog > August 2005 > Prolog and analytical calculations.
You are viewing an archived Text-only version of the thread.
To view this thread in it's original format and/or if you want to reply to
this thread please [click here]
| Author |
Prolog and analytical calculations.
|
|
| kurdayon@yahoo.com 2005-08-04, 5:04 pm |
| Hi,
Is it true that Prolog is a suitable programming language for
programming of analytical calculations? For example I have expression
and set of rules with which this expression can be transformed and I
want to transform the initial expression to the form which satisfies
some requirements.
Kurda Yon.
| |
| Bart Demoen 2005-08-04, 5:04 pm |
| kurdayon@yahoo.com wrote:
> Hi,
>
> Is it true that Prolog is a suitable programming language for
> programming of analytical calculations? For example I have expression
> and set of rules with which this expression can be transformed and I
> want to transform the initial expression to the form which satisfies
> some requirements.
>
> Kurda Yon.
>
You seem to want something like a constrained rewriting system.
One can certainly program such a thing more easily in Prolog than in
many other languages.
Maybe if you give more details, we can be of more help.
Cheers
Bart Demoen
| |
| kurdayon@yahoo.com 2005-08-04, 5:04 pm |
| The algebraic computations are close to what I want. We have some
expression (for instance "(x + y)*y - (x - y)*x") and we have some
set of rules (for instance "x + y = y + x, a*(c + d) = a*c + a*d, and
so on"). And we want to simplify the initial expression. Or let us
say, Rubik's cube. We have an initial state and limited set of
allowed transformations. Our goal is with the usage of allowed
transformations to reach state where all sides have the some color.
| |
| Bart Demoen 2005-08-04, 5:04 pm |
| kurdayon@yahoo.com wrote:
> The algebraic computations are close to what I want. We have some
> expression (for instance "(x + y)*y - (x - y)*x") and we have some
> set of rules (for instance "x + y = y + x, a*(c + d) = a*c + a*d, and
> so on"). And we want to simplify the initial expression. Or let us
> say, Rubik's cube. We have an initial state and limited set of
> allowed transformations. Our goal is with the usage of allowed
> transformations to reach state where all sides have the some color.
>
Ok. You want rewriting systems - google for them.
Or try to program exactly what you need in Prolog or in CHR which is
hosted by SWI-Prolog (and SICStus, Yap, ...).
Your main worries have now become termination and confluence :-)
Cheers
Bart Demoen
|
|
|
|
|