Super increasing sequences and learning of default rules - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Super increasing sequences and learning of default rules

Résumé

This paper points out that the same mathematical structure, called “superincreasing sequence” appears in various disguises in different areas such as nonmonotonic reasoning (in relation with the probabilistic representation of default rules), cryptography (as an application of the knapsack problem), or uncertainty modeling (when dealing with probability/possibility transformations). Apart from bridging research trends, which are usually considered separately, this note takes advantage of this parallel for discussing different approaches to the learning of default rules.
Fichier principal
Vignette du fichier
Super increasing sequences and learning of default rules.pdf (209.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03364213 , version 1 (05-10-2021)

Identifiants

  • HAL Id : hal-03364213 , version 1

Citer

Mathieu Serrurier, Didier Dubois, Henri Prade. Super increasing sequences and learning of default rules. 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2006), Jul 2006, Paris, France. ⟨hal-03364213⟩
18 Consultations
101 Téléchargements

Partager

Gmail Facebook X LinkedIn More