Thanks, Alex! This was useful info. I think a couple of words in the ref. (and or the tutorial) re. 'be' and new 'sym' clauses could be a good thing.
/Jon > On Tue, Dec 10, 2013 at 04:24:14PM +0100, Alexander Burger wrote: >> I'm not sure if this is documented in the references, but whenever 'be' >> detects a new 'sym' clause, it considers the previous rules to be >> finished. > > BTW, you could use 'asserta' and 'assertz' to extend existing rules: > > : (be boy (alex)) > : (be boy (bill)) > : (be boy (chuck)) > > : (be girl (diana)) > > : (rules 'boy 'girl) > 1 (be boy (alex)) > 2 (be boy (bill)) > 1 (be girl (diana)) > > : (assertz '(boy (eddy))) > > : (rules 'boy 'girl) > 1 (be boy (alex)) > 2 (be boy (bill)) > 3 (be boy (eddy)) > 1 (be girl (diana)) > > ?? Alex -- UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe
