If it is "best first", what heuristics are used to determine whether it is likely that a particular rule application has got us closer to our goal?.depth first, breadth first, depth first with iterative deepening, some kind of best first? What is the search strategy for applying rules? eg.isolate variable x) and then let it loose. I assume the idea, at least in the general case, is that you give the system a bunch of rules for manipulation of equations (like a*(b+c) = a*b + a+c) specify the goal (eg.
Unlike Prolog, LastCalc has a more powerful search algorithm, Prolog is "depth-first search with backtracking", LastCalc currently uses a heuristic best-first search.īefore delving into this I want to understand more about how other systems solve this problem, particularly Mathematica / Wolfram Alpha. Rather than hard-coding this in Java, I would like to enhance the fundamental language such that it can be extended to do these things using nothing but the language itself (as with Prolog). Remember it's a prototype.Ĭurrently LastCalc cannot simplify expressions or solve equations. You can see the source here and read about the architecture here. It already has quite a bit of functionality, you can check out the prototype at.
I'm building a web-based programming language partially inspired by Prolog and Haskell (don't laugh).
0 kommentar(er)
