Counting complexity of propositional abduction PDF
16 Pages·2010·0.29 MB·English
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
Preview Counting complexity of propositional abduction
Description:
We now show that the reduction is indeed parsimonious. The manifestations R together with the formulas xi → ri, xi → ri in T enforce that in every solution S of the proposi- tional abduction problem, we have to select at least one of xi and xi. The additional formula ¬xi ∨ ¬xi enforces that
See more
The list of books you might like
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
