The Possibilistic Horn Non-Clausal Knowledge Bases
This work addresses a bottleneck in automated reasoning for AI systems dealing with uncertainty, offering a tractable method for non-clausal formulas, though it is incremental within the specific domain of possibilistic logic.
The paper tackles the problem of handling uncertain and partially inconsistent information in non-clausal possibilistic logic, which is more practical for real-world problems but previously limited by clausal translators. It introduces a new class of possibilistic Horn non-clausal knowledge bases and proves that computing their inconsistency degree is polynomial-time, establishing the first characterized polynomial non-clausal class in this domain.
Posibilistic logic is the most extended approach to handle uncertain and partially inconsistent information. Regarding normal forms, advances in possibilistic reasoning are mostly focused on clausal form. Yet, the encoding of real-world problems usually results in a non-clausal (NC) formula and NC-to-clausal translators produce severe drawbacks that heavily limit the practical performance of clausal reasoning. Thus, by computing formulas in its original NC form, we propose several contributions showing that notable advances are also possible in possibilistic non-clausal reasoning. {\em Firstly,} we define the class of {\em Possibilistic Horn Non-Clausal Knowledge Bases,} or $\mathcal{\overline{H}}_Σ$, which subsumes the classes: possibilistic Horn and propositional Horn-NC. $\mathcal{\overline{H}}_Σ$ is shown to be a kind of NC analogous of the standard Horn class. {\em Secondly}, we define {\em Possibilistic Non-Clausal Unit-Resolution,} or $ \mathcal{UR}_Σ$, and prove that $ \mathcal{UR}_Σ$ correctly computes the inconsistency degree of $\mathcal{\overline{H}}_Σ$members. $\mathcal{UR}_Σ$ had not been proposed before and is formulated in a clausal-like manner, which eases its understanding, formal proofs and future extension towards non-clausal resolution. {\em Thirdly}, we prove that computing the inconsistency degree of $\mathcal{\overline{H}}_Σ$ members takes polynomial time. Although there already exist tractable classes in possibilistic logic, all of them are clausal, and thus, $\mathcal{\overline{H}}_Σ$ turns out to be the first characterized polynomial non-clausal class within possibilistic reasoning.