This is a very interesting project. I look forward to following its
development.
I did a presentation[1] on the implementation of the kibit[2] rule system a
few weeks ago which you might find interesting since it's using core.logic
as well.
[1]
Great resource!
I hope you don't mind if I steal ideas from it :)
On Thu, May 30, 2013 at 8:42 AM, Jonas jonas.enl...@gmail.com wrote:
This is a very interesting project. I look forward to following its
development.
I did a presentation[1] on the implementation of the kibit[2] rule system
Hello,
I am glad to announce that my proposal got accepted for google summer of
code.
I am doing the algebraic expression project idea which could lay the
foundation for a clojure CAS System by providing a library to manipulate
expressions syntactically
and also solving equations and optimizing
A very cool of use of core.logic, look forward to seeing where it goes :)
On Wed, May 29, 2013 at 11:10 AM, Maik Schünemann maikschuenem...@gmail.com
wrote:
Hello,
I am glad to announce that my proposal got accepted for google summer of
code.
I am doing the algebraic expression project
Hi - This looks great! Did you look at Mathematica at all? They have been
doing symbolic algebra for many years, and you might get some ideas there.
Also, I noticed that you don't have any commutative rules listed, eg:
(rule ['+ x y] := ['+ y x])
Wouldn't this reduce some of the duplication
Hi Alan.
Yes I looked at Mathematica even read a paper about its internal
implementation and that it is at its core basically a rewrite system!
(I also mentioned that in my proposal)
this commutative rule would cause an infinite loop because x and y match to
anything. So the result of applying the
Perhaps alphabetize the symbols to break the loop? It seems that something
is needed or you'll get a combinatorical explosion of rules!
Also, you need some system to say writing (* 3 x) is preferable to (+ x x
x) and the like. I have had good luck using an entropy based calculation
for scoring
Yes of course! this set of rules is only to test the functionality of the
rule based translator
expresso will take an input into a normal form. (the transformation itself
can be a set of rules)
In the normal form I will order the symbols alphabetically before the
symbols and try to mimimize
the
--On 29 mai 2013 19:02:18 +0200 Maik Schünemann
maikschuenem...@gmail.com wrote:
Yes I looked at Mathematica even read a paper about its internal
implementation and that it is at its core basically a rewrite system!
(I also mentioned that in my proposal)
You might also have a look at the
Thank you!
Pure looks very interesting
I will check how the rules are represented there
Am 30.05.2013 07:10 schrieb Konrad Hinsen
googlegro...@khinsen.fastmail.net:
--On 29 mai 2013 19:02:18 +0200 Maik Schünemann maikschuenem...@gmail.com
wrote:
Yes I looked at Mathematica even read a paper
10 matches
Mail list logo
