search

opencog / pln

Probabilistic Logic Network (PLN) implemented on top of the Unified Rule Engine (URE). https://wiki.opencog.org/w/Probabilistic_logic_networks
Other
15 stars 19 forks source link

Implement full deduction #50

Closed ngeiswei closed 2 years ago

ngeiswei commented 2 years ago

Unlike regular deduction (as defined in the PLN book), full deduction does not assume

P(C|B,A) = P(C|B)
P(C|¬B,A) = P(C|¬B)

This leads to a slightly more complex rule (even though it actually has less premises, those premises are more complex)

Implication <TV1>
  A
  B
Implication <TV2>
  And
    A
    B
  C
Implication <TV3>
  And
    A
    Not B
  C
|-
Implication <TV>
  A
  C

And the strength of the conclusion TV is

P(C|A) = P(C|B,A)×P(B|A) + P(C|¬B,A)×(1-P(B|A))
ngeiswei commented 2 years ago

Note that in this PR

conditional-full-instantiation

has been renamed into

conditional-total-instantiation

because "total" is a better opposite word of "partial" than "full".