On Fri, Nov 28, 2014 at 6:40 PM, Richard Fateman fate...@gmail.com wrote:
On Thursday, November 27, 2014 7:49:30 PM UTC-8, James Crist wrote:
Oh boy, this is going to be a big post. Responding to everyone in turn:
*@Aaron:*
Nonlinear, AC pattern matching is NP complete. Linear AC
@Richard,
Thanks for the Jenks paper, that was a good read. I also read your paper on
semantic matching http://dl.acm.org.ezp2.lib.umn.edu/citation.cfm?id=806300,
which only detailed the use of matching in Macsyma, and not its underlying
workings. I failed to find anything on how it actually
The system described in the Jenks paper would work better than what I've
written if we plan to use relatively small sets of small patterns. Larger
patterns, or larger rulesets will work better with what I'm writing, (I
think), as they will have more potential paths, and generating specialized
Am 29.11.2014 um 18:52 schrieb James Crist:
The system described in the Jenks paper would work better than what I've
written if we plan to use relatively small sets of small patterns. Larger
patterns, or larger rulesets will work better with what I'm writing, (I
think), as they will have more
Matching against identities can be valuable. Writing out several
variations for a intended single pattern feels like a hack.
Or at least, that was my experience with my matrix expressions system. I
wasn't able to cleanly add in identities so I shoved in lots more
patterns. Things worked.
The
On Friday, November 28, 2014 9:25:01 PM UTC-8, Joachim Durchholz wrote:
Am 29.11.2014 um 02:44 schrieb Richard Fateman:
On Thursday, November 27, 2014 10:35:34 PM UTC-8, Joachim Durchholz
wrote:
Awesome.
The papers I've read have been almost exclusively from the theorem
On Saturday, November 29, 2014 8:29:56 AM UTC-8, Aaron Meurer wrote:
big snip
.
Another question is, how can you teach the pattern matcher that a function
maps to an identity, like cos(a)*x can match x with a = 0, or x**a*y can
match y with a = 0?
You can do this (trivially)
Actually, my pattern matcher in Maxima DOES some solving... in particular
the example I gave..
matchdeclare(a,true);
defrule(r1,f(a+1), g(a));
r1(f(4)) returns g(3)
but it only solves simple linear forms.
I think the lisp code for my matcher is fairly clear. matcom.lisp is the
match
For some odd reason my local repo does not run concrete/delta doctests,
neither when given the direct command nor when directed to run all of
concrete, e.g.
$ bin/doctest concre
= test process starts
=
executable:
