The Possibilistic Horn Non-Clausal Knowledge Bases
share
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. Firstly, we define the class of Possibilistic Horn Non-Clausal Knowledge Bases, or ℋ_Σ, which subsumes the classes: possibilistic Horn and propositional Horn-NC. ℋ_Σ is shown to be a kind of NC analogous of the standard Horn class. Secondly, we define Possibilistic Non-Clausal Unit-Resolution, or 𝒰ℛ_Σ, and prove that 𝒰ℛ_Σ correctly computes the inconsistency degree of ℋ_Σmembers. 𝒰ℛ_Σ 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. Thirdly, we prove that computing the inconsistency degree of ℋ_Σ members takes polynomial time. Although there already exist tractable classes in possibilistic logic, all of them are clausal, and thus, ℋ_Σ turns out to be the first characterized polynomial non-clausal class within possibilistic reasoning.
READ FULL TEXT
