## Argumentative Inference in Uncertain and Inconsistent Knowledge Bases (1993)

Venue: | In Proceedings of Uncertainty in Artificial Intelligence |

Citations: | 68 - 3 self |

### BibTeX

@INPROCEEDINGS{Benferhat93argumentativeinference,

author = {Salem Benferhat and Didier Dubois and Henri Prade},

title = {Argumentative Inference in Uncertain and Inconsistent Knowledge Bases},

booktitle = {In Proceedings of Uncertainty in Artificial Intelligence},

year = {1993},

pages = {411--419},

publisher = {Morgan Kaufmann}

}

### Years of Citing Articles

### OpenURL

### Abstract

: This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation, taking into account the existence of consistent arguments in favor of a conclusion and the absence of consistent arguments in favor of its contrary, is particularly investigated. Flat knowledge bases, i.e. without any priority between their elements, as well as prioritized ones where some elements are considered as more strongly entrenched than others are studied under the different consequence relations which are considered. Lastly a paraconsistent-like treatment of prioritized knowledge bases is proposed, where both the level of entrenchment and the level of paraconsistency attached to a formula are propagated. The priority levels are handled in the framework of possibility theory. Keywords: Inconsistency; consequence relation; prioritized knowledge base; uncertainty; possibilistic logic; possibility theory. Submitted to the Ninth Annual...

### Citations

932 | A theory of diagnosis from first principles - Reiter - 1987 |

741 | The Uses of Argument - TOULMIN - 1958 |

383 | A Logical Framework for Default Reasoning - Poole - 1988 |

229 | Defeasible Reasoning - Pollock - 1987 |

208 | Preferred subtheories: an extended logical framework for default reasoning
- Brewka
- 1989
(Show Context)
Citation Context ...pproach propagates the effects of local inconsistency. 6. Combining knowledge bases Baral et al. (1992) propose several approaches to combine knowledge bases, and one of them is very similar to what (=-=Brewka, 1989) calls "preferred sub-theori-=-es". The idea is to assume a total ordering between different bases �� 1s�� 2s�� n , such that �� i is more reliable than �� j for j �� 1 by adding as many formulas as pos... |

187 | A Mathematical Treatment of Defeasible Reasoning and its Implementation - Simari, Loui - 1992 |

171 | System Z: A natural ordering of defaults with tractable applications to nonmonotonic reasoning
- Pearl
- 1990
(Show Context)
Citation Context ...t any revision process that satisfies natural requirements is implicitly based on such a set of priorities. Similarly a proper treatment of default rules also leads to prescribe priority levels (e.g. =-=Pearl, 1990-=-). In these two cases, the handling of priorities has been shown to be completely in agreement with possibilistic logic (Dubois, Lang and Prade, 1992b; Benferhat et al., 1992). Fox et al. (1992) also ... |

163 | Inconsistency management and prioritized syntax-based entailment
- Benferhat, Cayrol, et al.
- 1993
(Show Context)
Citation Context ...he following result holds: �� ; p f iff p(��) ; f However, this way of dealing with inconsistency is not entirely satisfactory, since it suffers from a principal drawback named "drowning =-=problem" in (Benferhat et al., 1993), as we can-=- see in the following examples: Examples: . Let �� be the following stratified knowledge base: �� = {{A �� B}, {A}, {B}, {C}} This notation of the form {B 1 , B 2 , ..., B n }, where the w... |

107 |
Combining knowledge bases consisting in first order theories
- Baral, Kraus, et al.
- 1992
(Show Context)
Citation Context ...erging two knowledge bases �� 1s�� 2 is equal to the union of the two bases if they are not conflictual, and is equal to �� 1 in other case. In the trusting attitude, the approach is very =-=similar to (Baral et al., 1992-=-) and produces always one resulting base, but unfortunately the approach is very restrictive since the knowledges bases to be merged must be sets of literals. In the context of possibilistic logic, an... |

99 | Representing default rules in possibilistic logic
- Benferhat, Dubois, et al.
- 1992
(Show Context)
Citation Context ...nogoods" used in the terminology of the ATMS (De Kleer, 1986). Once Inc(��) is computed, we remove from �� all elements of Inc(��), the result base is called the free base of ��, =-=denoted by Free(��) (Benferhat et al., 1992). In ot-=-her words, the set Free(��) contains all formulae which are not involved in any inconsistency of the knowledge base ��. Now, let us introduce the notion of the Free consequence, denoted by ; F... |

49 | Arguments, contradictions and practical reasoning - Fox, Krause, et al. - 1992 |

46 | Automated reasoning using possibilistic logic: semantics, belief revision and variable certainty weights - Dubois, Lang, et al. - 1994 |

46 | Knowledge in Flux: Modelling the dynamics of epistemic states - G��rdenfors - 1988 |

23 | Reasoning from inconsistency: A taxonomy of principles for resolving conflict - Pinkas, Loui - 1992 |

23 | A Logic for Reasoning with Inconsistent Knowledge - Roos - 1992 |

14 | A logical approach to multi-sources reasoning - Cholvy - 1992 |

14 | On inference from inconsistent premises - Rescher, Manor - 1970 |

12 |
unknown title
- Costa
- 1963
(Show Context)
Citation Context ...ge base contains only the two contradictory statements {f,f} then the inference f �� f ;A y does not hold. In other words, our approach is in agreement with the idea of paraconsistent logics (e.g.=-= Da Costa, 1963), where t-=-hey reject the principle "ex absurdo quodlibet" which allows the deduction of any formula from an inconsistent base. The next propositions give some properties of the argumentative inference... |

8 | A Probabilistic Interpretation for Lazy Nonmonotonic Reasoning - Satoh - 1990 |

7 |
Reasoning in the presence of inconsistency
- Lin
- 1987
(Show Context)
Citation Context ...s the existence of an 15 algorithm which checks if there exists an argument for a given formula in some base. This can be achieved by using the variant of a refutation method proposed for example in (=-=Lin, 1987-=-). The procedure is based on a construction of the maximal argument of f and its contradiction. First we start with the sub-base B 1 , and we check if there is a consistent subbase of B 1 which entail... |

5 | Handling uncertainty, context, vague predicates, and partial inconsistency in possibilistic logic - Dubois, Lang, et al. - 1991 |

2 | Prade (1992a) Inconsistency in possibilistic knowledge bases --- To live or not live with it - Dubois, Lang, et al. |

2 | Kleer (1986a). An assumption-based TMS - De |

2 |
A formal model of diagnosis inference
- Reggia, Nau, et al.
- 1985
(Show Context)
Citation Context ... the number of the conflicts in ��. 2 The ordering defined on elements of MC(��) is called the lexicographical ordering, and corresponds to the property of parsimony advocated in diagnostic pr=-=oblems (Reggia et al., 1985). 7-=- In order to generate the set of plausible inferences based on Lex(��) from an inconsistent knowledge base, we use a definition similar to the MC-consequence: Definition: A formula f is said to be... |

1 | Prade (1992b) Possibilistic logic - Dubois, Lang, et al. |

1 | Prade (1992c) Dealing with multi-source information in possibilistic logic - Dubois, Lang, et al. |