Circumscribing Inconsistency
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 150-154.
Abstract
We present a new logical approach to reasoning from inconsistent information. The idea is to restore modelhood of inconsistent formulas by providing a third truth-value tolerating inconsistency. The novelty of our approach stems first from the restriction of entailment to three-valued models as similar as possible to two-valued models and second from an implication connective providing a notion of restricted monotonicity. After developing the semantics, we present a corresponding proof system that relies on a circumscription schema furnishing the syntactic counterpart of model minimization.
@inproceedings{ijcai1997p23,
title = {Circumscribing Inconsistency},
author = {Besnard, Philippe and Schaub, Torsten},
booktitle = {Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence, {IJCAI-97}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Martha E. Pollack},
pages = {150--154},
year = {1997},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1997/23},
}
TY - CPAPER TI - Circumscribing Inconsistency AU - Besnard, Philippe AU - Schaub, Torsten T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 150 EP - 154 UR - https://ijcai.org/proceedings/1997/23 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: