Unirefs.
We already have prolog variables, and prolog unify. Such a mechanism
ought to be integrated.
The way I would like to extend the poplog matcher is in a different
direction, by allowing more kinds of pattern. Eg as well as
pop11 segment variables (*very* tricky with the uniref approach)
I would like commutative and/or associative and/or idempotent
options on the matcher, so that eg
[a b c] matches$c,a$ [c a b]
and
[b a l l e r] matches$i$ [b a l e r]
some combinations of these operations (and a few more) operations lead
to NP-complete (or even undecidable) matching problems, but there are
lots of special cases.
Cheers,
Jonathan Cunningham
|