Deploying OpenRules Applications on Cloud

A week ago at JavaOne Conference in San Francisco I had a chance to talk directly with several providers of cloud deployment solutions for Java applications. I was really impressed with a Ukrainian startup “Jelastic” that just won the Java Community’s version of Oscar and was endorsed by Dr. Gosling – read more here. Coming back home to NJ, I decided to try it myself. I took the existing web application that implements a popular game “Nim” using OpenRules decision tables and forms. It looks as follows:

Previously this web application was deployed at the local Tomcat, and I wanted to move it to the Jelastic’s cloud with minimal efforts.  And I had almost no problems of doing that! Now you may try to play Nim yourself from the cloud using this URL http://openrules.jelastic.servint.net/Nim/. What have I actually done?

Continue reading

Fischer vs. Kasparov vs. Karpov

On a long flight back to the US I had a few hours to kill. So, I decided to implement one of my favorite modeling tests that I used to give to my students and they always enjoyed it. This time I wanted to try it myself with the newest OpenRules Decision Modeling facilities (see Rule Solver).

Virtual Chess Tournament
Three world champions Fischer, Kasparov, and Karpov played in a virtual chess tournament. Each player played 7 games against two other opponents. Each player received 2 points for a victory, 1 for a draw, and 0 for a loss. We know that Kasparov, known as the most aggressive player, won the most games. Karpov, known as the best defensive player, lost the least games. And Fischer, of course, won the tournament. Continue reading

Rule Engines: RETE and Alternatives

The famous RETE algorithm was invented by Dr. Charles Forgy more than 30 years ago and it still remains the foundation for most implementations of inferential rule engines.  Recently Carole-Ann asked the question: why after all these years there were no practical alternatives to RETE? Continue reading

Modeling Decisions for Scheduling and Resource Allocation Problems

“Reality is built in wonderful simplicity”, Eliyahu Goldratt “The Choice

Scheduling and Resource Allocation are traditionally considered as very complex business problems. They are usually out of reach for the most rule engines.  I personally learned how to deal with these complex problems during my real-world consulting practice by applying a great product called “ILOG Scheduler” written by Claude LePape and Jean-Francois Puget 20 years ago. I’ve just googled the product name and got this User Manual that has over 600 pages with a lot of C++ code. I used to teach ILOG Solver/Scheduler courses and will reuse some examples borrowed from them. Continue reading

In memory of Eliyahu Goldratt

Today searching web for goal programming sources I suddenly learned that last year Eliyahu Goldratt died. He was 64. I remember how impressed I was with his books “The Goal” and “Theory of Constraints” that helped me with an implementation of a custom supply chain system at the end of 90’s. I remember reading “The Goal” aloud to my wife – it was more than another technical book. Not being a native English speaker, he used plain English to explain complex issues in a very unconventional way. Continue reading

Different Decision Tables for a Very Simple Use Case

The responses to the RFP of OMG  DMN (Decision Model and Notation) standard are scheduled to arrive in May of 2012. Trying to keep this process as close as possible to the everyday decision management reality, I posted several use cases at the DMN Discussion Group and tried to formulate down-to-earth questions that DMN will hopefully address. Here I want to take almost trivial rules and discuss different implementation options using decision tables. Continue reading

Representing and Solving Rule-Based Decision Models with Constraint Solvers

The latest rules conferences RulesFest-2011, BBC-2011, and RuleML-2011 were really great events in general and for OpenRules in particular. We announced a new constraint-based Rule Engine that is the first alternative to Rete-based implementations of a real inferencial rule engine. Continue reading

OpenRules 6.1.1 is available for downloads

A new release 6.1.1 further advances the Executable Decision Model introduced by the OpenRules-6 in March 2011. It provides new features based on the real-world feedback. In particular, the release 6.1.1 includes more advanced templates for for Decisions, Decision Tables, and Glossaries. It also allows a user to go beyond the limitations of the Decision Model by adding different kinds of decision tables that support rules overrides. Continue reading

About OpenRules Scalability

Being in real-world production environment for many years, OpenRules Engine has a proven record of high efficiency and scalability. Several years ago some of our customers (a major European bank and a large government agency) assigned teams of people to do stress-testing of our product before they decided to use it instead of commercial counter-parts. The results were really good. Continue reading

OMG Decision Model Notation (DMN)

On March 23, 2011 I attended the Object Management Group‘s Decision Modeling Notation (DMN) day in Arlington, VA.  There were very interesting presentations from vendors and practitioners devoted to decision modeling in general and decision tables in particular – see the detailed report at the James Taylor’s blog. You may find more information about the DMN in this article. Continue reading

By jacobfeldman Posted in Events Tagged

Connecting The Dots

On January 8, 2010 after the notorious “underwear bomber” attack Tom Davenport wrote:

How easy is it to connect the dots? Granted, there were numerous indications of Abdul Mutallab’s evil intent. But it would have been difficult to put them together before the flight. Combining disparate pieces of information about people – whether they are customers or terrorists – is akin to solving a complex jigsaw puzzle.Continue reading

Rule Solver is now JSR-331 Compliant

OpenRules has announced that its redesigned Rule Solver™ is now JSR-331 compliant. Rule Solver™ is a long time available optimization component of OpenRules® BRMS that allows users to define and solve constraint satisfaction and optimization problems within a business rules environment. Continue reading