A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
On the Compilation of Stratified Belief Bases under Linear and Possibilistic Logic Policies
2007
International Joint Conference on Artificial Intelligence
Developing efficient approaches for reasoning under inconsistency is an important issue in many applications. Several methods have been proposed to compile, possibly inconsistent, weighted or stratified bases. This paper focuses on the well-known linear order and possibilistic logic strategies. It provides a way for compiling a stratified belief base in order to be able to process inference from it in polynomial time. The resulting extra compilation cost is very low. In particular, the number
dblp:conf/ijcai/BenferhatYD07
fatcat:ij3ap5gdvjemtfkg33534pie6u