Thanks for the reply, I know that a binary xor can be transformed into the expression you mention. It's more that I'm worried about situations where I have like five inputs and the expressions become very lengthy...
Fortunately I'm using code generation for my purpose. But nevertheless: are rules efficient to match very long combinations like that? Thanks, Henrik [EMAIL PROTECTED] wrote: >I think Henrik Rentz-Reichert wrote: > > > >>Unfortunately there is no xor CE in Jess. How can I simulate that in >>the simplemost way? >> >> > >"xor A B" can be written as (A and not B) or (B and not A) -- i.e., > >(or (and (A) (not (B))) (and (B) (not (A)))) > > >Note: Please don't send HTML-only mail to mailing lists (or to >anybody, really.) > >--------------------------------------------------------- >Ernest Friedman-Hill >Advanced Software Research Phone: (925) 294-2154 >Sandia National Labs FAX: (925) 294-2234 >PO Box 969, MS 9012 [EMAIL PROTECTED] >Livermore, CA 94550 http://herzberg.ca.sandia.gov > >-------------------------------------------------------------------- >To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' >in the BODY of a message to [EMAIL PROTECTED], NOT to the list >(use your own address!) List problems? Notify [EMAIL PROTECTED] >-------------------------------------------------------------------- > > > -- ................................................. Dr. Henrik Rentz-Reichert mailto://[EMAIL PROTECTED] Hafnerstr. 1 fon +49-7533-9342-43 D-78476 Allensbach fax -44 -------------------------------------------------------------------- To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' in the BODY of a message to [EMAIL PROTECTED], NOT to the list (use your own address!) List problems? Notify [EMAIL PROTECTED] --------------------------------------------------------------------
