Preferential and Preferential-discriminative Consequence relations
<|reference_start|>Preferential and Preferential-discriminative Consequence relations: The present paper investigates consequence relations that are both non-monotonic and paraconsistent. More precisely, we put the focus on preferential consequence relations, i.e. those relations that can be defined by a binary preference relation on states labelled by valuations. We worked with a general notion of valuation that covers e.g. the classical valuations as well as certain kinds of many-valued valuations. In the many-valued cases, preferential consequence relations are paraconsistant (in addition to be non-monotonic), i.e. they are capable of drawing reasonable conclusions which contain contradictions. The first purpose of this paper is to provide in our general framework syntactic characterizations of several families of preferential relations. The second and main purpose is to provide, again in our general framework, characterizations of several families of preferential discriminative consequence relations. They are defined exactly as the plain version, but any conclusion such that its negation is also a conclusion is rejected (these relations bring something new essentially in the many-valued cases).<|reference_end|>
@article{ben-naim2005preferential,
    title={Preferential and Preferential-discriminative Consequence relations},
    author={Jonathan Ben-Naim (LIF)},
    journal={Journal of Logic and Computation 15 (2005) number 3, pp. 263-294},
    year={2005},
    doi={10.1093/logcom/exi013},
    archivePrefix={arXiv},
    eprint={cs/0506030},
    primaryClass={cs.AI cs.LO}
}