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.
Domaines
Intelligence artificielle [cs.AI]
Fichier principal
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)