#ORF09 Graph Based Knowledge Bases and Rules Presentation

This entry is part 10 of 30 in the series October Rules Fest 2009

Luke Voss was presenting on how over time he was struggling on how to represent his knowledge for computers to use.

He recently worked on what he called a “toy rule engine” in which he uses relationships between facts, not just pure facts. So the rule engine uses 2 “fact” bases, the facts and the relationships.

His representation was then presented in a graph and he tells us that Graph Theory can be leveraged to give him some of the tools he needed to deal with the data when it is structured in such a way. But now how can you use this with a rule engine?

So he turned to pattern match for structural matching and also worked with helpers so that you could use a visual pattern designer to express your pattern matching statements. This is used to generate some code.

For exploring, he uses a sub-graph query viewer, working on the unstructured data set as well as a local navigation explorer to explore the data that you have available.

He then covered some of the theory behind dealing with graphs.

He closed his presentation saying that to him, it is easier to deal with visual models rather than text models. He is thinking that there is a relative closeness between rule applications and routing problems. He also sees opportunities to extend the rule engine language for joins by inject information. He is in tune with Mark Procter’s vision of some of the features that might come in future versions of rule engines.

Tags: , ,

Leave a Reply