RuleML-2009 Challenge

The RuleML-2009 Challenge is one of the highlights of RuleML-2009. Rules are used in interesting and practically relevant ways to, e.g., derive useful information, transform knowledge, provide decision support and provide automated rule-based monitoring, enforcement, validation or management of the behavioral logic of the application. The Challenge offers participants the chance to demonstrate their commercial and open source tools, use cases, and applications.
Submissions are solicited in these categories:
• Benchmarks (test cases, suites) with evaluations of (their own, other) rule engines and/or rule translators, possibly drawing on our growing pool in

http://ruleml-challenge.cs.nccu.edu.tw/?q=node/31
• Case studies (use cases) implemented via engines/translators employing rule standards such as CLIPS, JESS, ISO PROLOG, CL, RuleML, and RIF
We welcome all demos about tools and applications using rules such as:
• Derivation rules, including query and integrity rules 
• ECA rules, including production rules, reaction rules, and rule-based CEP languages
Prestigious prizes will be awarded to the two best applications from each category. All accepted demos will be presented in a special Challenge Session. A submission to the RuleML Challenge has to meet the requirement that declarative rules explicitly play a central role in the application. Basically this means that: Rules are explicitly represented in a declarative format and they are decoupled from the application (rather than being compiled or hard-coded into the application logic). The demo should preferably (but not necessarily) be embedded into a web-based or distributed environment so that there will be a need for features related to the RuleML conference topics, as listed in the call for papers.