Resource-bounded inference from inconsistent belief bases
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 103-107.
Abstract
A family of resource-bounded paraconsistent inference relations is introduced. These relations are based on S - 3 entailment, an inference relation logically weaker than classical entailment and parametrized by a set S of variables. Their properties are investigated, especially from the computational complexity point of view. Among the strong features of our framework is the fact that tractability is ensured each time S is bounded and that binary connectives behave in a classical manner. Moreover, our family is large enough to include both S - 3 inference, the standard inference relations based on the selection of consistent subbases and some additional forms of paraconsistent reasoning as specific cases.
@inproceedings{ijcai2001p14,
title = {Resource-bounded inference from inconsistent belief bases},
author = {Marquis, Pierre and Porquet, Nadège},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {103--107},
year = {2001},
url = {https://ijcai.org/proceedings/2001/14},
}
TY - CPAPER TI - Resource-bounded inference from inconsistent belief bases AU - Marquis, Pierre AU - Porquet, Nadège T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 103 EP - 107 UR - https://ijcai.org/proceedings/2001/14 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
