On the Compilation of Stratified Belief Bases under Linear and Possibilistic Logic Policies
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 2425-2429.
Abstract
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 of additional variables, that are added to original stratified bases, corresponds exactly to the number of priority levels existing in the base. Moreover, our compilation approach allows an efficient computation of weighted possibilistic conclusions and possibilistic conditioning.
@inproceedings{ijcai2007p390,
title = {On the Compilation of Stratified Belief Bases under Linear and Possibilistic Logic Policies},
author = {Benferhat, Salem and Yahi, Safa and Drias, Habiba},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {2425--2429},
year = {2007},
url = {https://ijcai.org/proceedings/2007/390},
}
TY - CPAPER TI - On the Compilation of Stratified Belief Bases under Linear and Possibilistic Logic Policies AU - Benferhat, Salem AU - Yahi, Safa AU - Drias, Habiba T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 2425 EP - 2429 UR - https://ijcai.org/proceedings/2007/390 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
