On Tue, Apr 12, 2011 at 8:03 AM, Arjun Dhar <dhar_ar@yahoo.com> wrote:

Hi,
though it is clear Rule Engine (lke Drools) supports Declarative
programming and First order Logic or FOL (with existential quantifiers and
works) .... am also looking for Probabilistic Reasoning.

Example:
Fact: A U B => C; this fact exists with a probability of 0.9.
Principles namely being: Locality, Detachment, Truth functionality (i.e.
when predicates in facts are not mutually exclusive then probabilistic
calculations are not as simple as Boolean operations) etc.

Has such theory been worked into Drools yet or are there any plans for the
future?
I'd assume the same concepts can be used on Fuzzy rules and fuzzy sets.

Am sure these are practical issues that at some point the Drools team would
have thought about. Whats the direction on this?

thanks

--
View this message in context: http://drools.46999.n3.nabble.com/Support-for-Probabilistic-reasoning-FOL-tp2810931p2810931.html
Sent from the Drools: User forum mailing list archive at Nabble.com.
_______________________________________________
rules-users mailing list
rules-users@lists.jboss.org
https://lists.jboss.org/mailman/listinfo/rules-users