Sensitivity analysis in probabilistic argumentation systems

Abstract

A sensitivity analysis method is built upon a PAS framework that includes a knowledge base defined by a set of propositions, a set of logical statements over the propositions, a set of assumptions for each statement and the corresponding assumption probabilities. The knowledge base is queried to determine the quasi-support qs(H) and qs(⊥). Disjoint arguments of the quasi-support are then found for both the hypothesis H and contradiction ⊥. Symbolic formulas dqs(H) and dqs(⊥) are formed for the degree of quasi-support for hypothesis H and contradiction ⊥, respectively, based on these disjoint arguments. The partial derivatives D H , j ≡ ∂ dqs ⁡ ( H ) ∂ r j ⁢ ⁢ of ⁢ ⁢ dqs ⁡ ( H ) ⁢ ⁢ and ⁢ ⁢ D ⊥ , j ≡ ∂ dqs ⁡ ( ⊥ ) ∂ r j of dqs(⊥) are computed with respect to the assumption probability rj. Sensitivity analysis formulas ƒ(H,DH,j,D⊥,j,rj,δrj) are then formed from the partial derivatives to establish the relationship between a PAS output, such as the degree of support dsp( ), degree of doubt ddb( ), and degree of possibility dps( ), for hypothesis H, and the assumption probabilities under a given input condition. The formulas can be used to determine how to tune the assumption probabilities to achieve the desired PAS output values, to identify key assumption probabilities, to measure the sensitivity of the system to the assumption probabilities, to account for input variability, to identify contradictions in the knowledge base and so forth.

Dependencies are inferred from the claim text.