User Activity

  • Posted a comment on discussion Help on CLIPS Rule Based Programming Language

    OK, got it. Thanks Vranoch

  • Posted a comment on discussion Help on CLIPS Rule Based Programming Language

    Hello Gary, could You please explain me, why the following 2 rules behave differently (A fires and B does not) on the same facts? They differ just in the order of one fact. Thanks Vranoch (deffacts XY (LVAR LV-arr 1 "A") (LVAR LV-arr 1) (LVAR LV-arr 2 "B") (LVAR LV-arr 2) (LVAR LV-arr 3 "A") (LVAR LV-arr 3) (LVAR LV-arr 4 "A") (LVAR LV-arr 4) (IX X1 1) ) (defrule A "" (forall ; (LVAR LV-arr ?IX_1 ) (IX X1 ?X1) (LVAR LV-arr ?IX_1 ) (LVAR LV-arr ?X1 ?X1_var) (LVAR LV-arr ?IX_1 ?IX_1_var) (test (eq...

  • Posted a comment on discussion Help on CLIPS Rule Based Programming Language

    The (test ) expressions are in a reality not duplicated, they test different fact variables - I only hypersimplified the rule in order to fit into the memory. I will try to achieve something like V3663_A2_E1004_1_if-3 but for that I need to convert the complex boolean expression to a DNF (Disjuncrive normal form (AND (OR) (OR))) or to a CNF (Conjunctive normal form (OR (AND) (AND))) in order to be able to efficiently reorganize the expression and perhaps extract parts of it and place in between facts....

  • Posted a comment on discussion Help on CLIPS Rule Based Programming Language

    Thanks a lot Gary, Since the rules are generated I do not have an easy control over their structure. I will have to create some mechanism to reorder the LHS elements. Namely CEs will not be easy. I think about converting all complex AND / OR conditions to simple (NOT) ANDs and then simply reordering them. Is there any performance difference between OR and AND NOT? Is there any other hidden issue that needs some special treatment? Thanks Vranoch

  • Posted a comment on discussion Help on CLIPS Rule Based Programming Language

    Hello Gary, I encountered an OutOfMemory issue when processing a large set of facts with my ruleset. I isolated the rule causing the problem. I simplified it so that it does not make a big sense but the essence remains. WIth the factset it easily gets over 2GB of memory and then fails. I understand that such inference is generally a very memory consuming task since it yealds a cartesian product however, isn't there a way how to reduce it? For example I noticed that adding facts to the LHS side (even...

  • Posted a comment on discussion Help on CLIPS Rule Based Programming Language

    Hello Gary, I found that for more complex expressions the inicialization of the pretty print buffer overflows. The original buffer size is 120 characters, I patched it in my copy to 1024. Isn't there any way to make it not hard-coded? Thanks Vranoch file: pprint.c globle void PPCRAndIndent( void *theEnv) { int i; **char buffer[1024];**

  • Posted a comment on discussion Help on CLIPS Rule Based Programming Language

    OK, thanks for info. Btw what are the main differences between 6.30 and 6.40 (and...

  • Posted a comment on discussion Help on CLIPS Rule Based Programming Language

    Hi Gary, What is the status of the 64x branch? Is it still in a pre-beta state or...

View All

Personal Data

Username:
vranoch
Joined:
2009-04-21 15:36:44

Projects

  • No projects to display.

Skills

  • No skills entered.

Personal Tools