JESS: SUM of slots

2011-08-17 Thread Nessrine Nassou
Hi all,
 #56319;
How can i implement the SUM ( ∑ )  in jess? i have a template which contain 
persons, and for each person there is a slot risk , i want to calculate the 
SUM of all risks of all persons (∑ risk(i)   i: person i) 

Thanks for all,

Have a nice day.
#56319;

Re: JESS: Call for Demos: RuleML2011@BRF - 5th International Rule Challenge

2011-07-25 Thread Nessrine Nassou
Hi all, 

Could anyone tell me if the  random  function of  jess is  normal or uniform?  

Thank you for help 




From: Wolfgang Laun wolfgang.l...@gmail.com
To: jess-users@sandia.gov
Sent: Tue, July 19, 2011 7:19:15 PM
Subject: JESS: Call for Demos: RuleML2011@BRF - 5th International Rule Challenge



Dear Jess users,

apologies if you receive this more than once, but I think that Jess users are 
in 
a particularly well equipped position for participating in this rule challenge, 
and that's why I gladly take the opportunity to post this call for on this 
list. 


==* 
* RuleML2011@BRF - 5th International Rule Challenge *   
* Nov 4th   *
* Westin Diplomat, Ft Lauderdale, Florida   *
* http://2011.ruleml.org/america/?page_id=126   *
*
* Call for Demos - Submission Deadline - Sept. 2nd, 2011*
* New categories in the Challenge with prestigious prizes   *
* Demo papers published as CEUR proceedings *
* 15% RuleML2011@BRF Partner discounts - see registration page  *
* http://2011.ruleml.org/america/   *
* http://www.businessrulesforum.com/register.php*
*
 
Overview and Aim
==
 
The RuleML2011@BRF Challenge is one of the highlights at RuleML2011@BRF 
Conference.The RuleML2011@BRF Challenge is dedicated to practical experiences 
with rule-oriented applications. In particular, submissions of benchmarks / 
evaluations, demos, case studies / use cases, experience reports, best practice 
solutions (e.g. design patterns, reference architectures, models), rule-based 
implementations / tools / applications, demonstrations of engineering methods, 
implementations of rule standards (e.g. RuleML, RIF SBVR, PRR, rule-based Event 
Processing languages, BPMN+rules, BPEL+rules,...), rules + industrial standards 
(e.g. XBRL, MISMO, Accord, ...), and industrial problem statements are 
particularly encouraged.
 
 
Key themes of the RuleML2011@BRF Challenge include the following:
* Demos related to the RuleML2011@BRF Track Topics
* Extensions and implementations of rule standards: W3C RIF, RuleML, SBVR,...
* Editing environments and IDEs for Web rules
* Benchmarks and comparison results for rule engines
* Distributed rule bases and rule services
* Reports on industrial experience about rule systems
 
A dedicated track of RuleML2011@BRF Challenge will be focused on the theme:
 
**Combining Rules, Objects, and Ontologies: Implementations and Applications**
- Loose/tight integrations of rules and knowledge bases
- Knowledge Modelling and Reasoning
- Real cases and practical experiences
 
Ideally, demos submitted to the Challenge track should tackle knowledge-rich 
domain problems. The proposed solution should address such problem using a 
combination of rule-based modelling and semantic knowledge-based modelling. 
Solutions ranging from loosely coupled hybrid systems (i.e. where different 
frameworks are put together), to unified homogeneous architectures (i.e. where 
a 
unified model / semantics, within a single framework, is proposed) will be of 
great interest for the special track.
Prizes will be awarded to the two best applications from the main focus them 
and 
for the all categories. All accepted demos will be presented in a special 
Challenge Session.
 
Submission
==
 
The submission is composed of two parts:
- open-source or commercial demo
- demo papers describing research, implementation, and technical details of 
your 
submission.
Submissions to the Rules Challenge 2011 consist of a demo paper of 4-8 pages 
describing the demo show case, and a link to the demo/show case, e.g.  project 
site, an online demonstration, a presentation about the demonstration or a 
download site for the demonstration.
Demo and papers submission website:
https://www.easychair.org/conferences/?conf=ruleml2011challenge
 
Please upload all demo papers submissions as PDF files in LNCS format
(http://www.springer.de/comp/lncs/authors.html). 
To ensure high quality, submitted papers will be carefully peer-reviewe 
according to the evaluation criteria indicated below.
 
To better disseminate your work, please also udpate your demo in the systems 
submission website with a brief abstract presentation:
http://2011.ruleml.org/america/?page_id=184
 
Challenge Evaluation Criteria 
==
 
Submissions to the RuleML2011@BRF Challenge general Track will be evaluated 
according to the following criteria:
- clear exposition of the objectives, outcomes, benefits for going beyond the 
state of the 

Re: JESS: On the Performance of Logical Retractions

2011-06-08 Thread Nessrine Nassou
Hi to all, i need help please. How can i import the jess class Rete in java 
application? 


thanks for help 




From: Ernest Friedman-Hill ejfr...@sandia.gov
To: jess-users@sandia.gov
Sent: Mon, June 6, 2011 1:37:16 PM
Subject: Re: JESS: On the Performance of Logical Retractions

I don't think there's a particular reason in general. Retracting a fact takes 
only a little longer than asserting one, on average. But if we assume liberal 
use of logical, retracting a single fact could result in a sort of cascade 
effect whereby retracting a single fact would result in many other facts, and 
many activations, being removed also due to dependencies.  All of that would 
take time.  Still, your case seems extreme. Maybe there's something 
pathological 
about this particular case.


On Jun 5, 2011, at 3:18 PM, Md Oliya wrote:

 Hi,
 
 I am doing some experiments with a set of rules which contain the logical 
CE.
 I intend to see the performance of Jess on a set of assertions as well as 
retractions.
 
 After some experiments, I found that the runtime for assertions is much less 
than that of retractions.
 In fact, the performance on retractions is so bad that I would rather re 
 (run) 
jess on a retracted kb.
 
 
 A sample test case:
 The KB size,  number of assertions, number of retractions, and number of 
 rules 
are 100K, 50K, 1k, and 100, respectively.
 runtimes are  initial run: 860ms,  assertions:320ms --  retractions: 4s.
 
 
 Would you please give some hints on the reason?
 
 
 Thanks in advance.
 --Oli.

-
Ernest Friedman-Hill
Informatics  Decision Sciences, Sandia National Laboratories
PO Box 969, MS 9012, Livermore, CA 94550
http://www.jessrules.com








To unsubscribe, send the words 'unsubscribe jess-users y...@address.com'
in the BODY of a message to majord...@sandia.gov, NOT to the list
(use your own address!) List problems? Notify owner-jess-us...@sandia.gov.