Representing default rules in possibilistic logic - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1992

Representing default rules in possibilistic logic

Résumé

A key issue when reasoning with default rules is how to order them so as to derive plausible conclusions according to the more specific rules applicable to the situation under concern, to make sure that default rules are not systematically inhibited by more general rules, and to cope with the problem of irrelevance of facts with respect to exceptions. Pearl's system Z enables us to rank-order default rules. In this paper we show how to encode such a rank-ordered set of defaults in possibilistic logic. We can thus take advantage of the deductive machinery available in possibilistic logic. We point out that the notion of inconsistency tolerant inference in possibilistic logic corresponds to the bold inference ; 1 in system Z. We also show how to express defaults by means of qualitative possibility relations. Improvements to the ordering provided by system Z are also proposed.
Fichier non déposé

Dates et versions

hal-04069105 , version 1 (14-04-2023)

Identifiants

  • HAL Id : hal-04069105 , version 1

Citer

Salem Benferhat, Didier Dubois, Henri Prade. Representing default rules in possibilistic logic. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR 1992), Oct 1992, Cambridge, MA, United States. pp.673--684. ⟨hal-04069105⟩
4 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More