Reasoning with maximal consistent signatures
<|reference_start|>Reasoning with maximal consistent signatures: We analyse a specific instance of the general approach of reasoning based on forgetting by Lang and Marquis. More precisely, we discuss an approach for reasoning with inconsistent information using maximal consistent subsignatures, where a maximal consistent subsignature is a maximal set of propositions such that forgetting the remaining propositions restores consistency. We analyse maximal consistent subsignatures and the corresponding minimal inconsistent subsignatures in-depth and show, among others, that the hitting set duality applies for them as well. We further analyse inference relations based on maximal consistent subsignatures wrt. rationality postulates from non-monotonic reasoning and computational complexity. We also consider the relationship of our approach with inconsistency measurement and paraconsistent reasoning.<|reference_end|>
@article{thimm2024reasoning,
    title={Reasoning with maximal consistent signatures},
    author={Matthias Thimm, Jandson Santos Ribeiro Santos},
    journal={arXiv preprint arXiv:2408.17190},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.17190},
    primaryClass={cs.AI}
}