Computer Science – Artificial Intelligence
Scientific paper
2005-06-09
Journal of Logic and Computation 15 (2005) number 3, pp. 263-294
Computer Science
Artificial Intelligence
team Logic and Complexity, written in 2004-2005
Scientific paper
10.1093/logcom/exi013
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).
No associations
LandOfFree
Preferential and Preferential-discriminative Consequence relations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Preferential and Preferential-discriminative Consequence relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preferential and Preferential-discriminative Consequence relations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-170367