Computing Proper Implications

Rafik Taouil 1 Yves Bastide 2
1 ORPAILLEUR - Knowledge representation, reasonning
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This paper presents the proper implications: all implications holding on a set with a minimal left-hand side and a one-item right-hand side. Although not the smallest representation, they are easily readable and allow for some efficient selection and projection (embedding) operations. The proposed algorithm, Impec, is designed to efficiently find proper implications given a set and a closure operator on this set. Additionally, it can be easily extended with a weight function or to compute embedded implications.
Type de document :
Communication dans un congrès
9th International Conference on Conceptual Structures: Broadening the Base - ICCS'2001, Jul 2001, Stanford, CA US, 13 p, 2001
Liste complète des métadonnées

https://hal.inria.fr/inria-00100664
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:48:46
Dernière modification le : jeudi 11 janvier 2018 - 06:19:52

Identifiants

  • HAL Id : inria-00100664, version 1

Citation

Rafik Taouil, Yves Bastide. Computing Proper Implications. 9th International Conference on Conceptual Structures: Broadening the Base - ICCS'2001, Jul 2001, Stanford, CA US, 13 p, 2001. 〈inria-00100664〉

Partager

Métriques

Consultations de la notice

239