Exploiting Functional Dependencies in Qualitative Probabilistic Reasoning
This work addresses a specific issue in qualitative probabilistic networks for researchers in AI and reasoning, but it appears incremental as it builds on existing methods with modifications.
The paper tackled the problem of qualitative ambiguity in probabilistic reasoning by exploiting functional dependencies, resulting in a modified inference scheme that reduces ambiguity through deterministic variables and updated graphical transformations.
Functional dependencies restrict the potential interactions among variables connected in a probabilistic network. This restriction can be exploited in qualitative probabilistic reasoning by introducing deterministic variables and modifying the inference rules to produce stronger conclusions in the presence of functional relations. I describe how to accomplish these modifications in qualitative probabilistic networks by exhibiting the update procedures for graphical transformations involving probabilistic and deterministic variables and combinations. A simple example demonstrates that the augmented scheme can reduce qualitative ambiguity that would arise without the special treatment of functional dependency. Analysis of qualitative synergy reveals that new higher-order relations are required to reason effectively about synergistic interactions among deterministic variables.