Computing Proper Implications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Computing Proper Implications


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.
Not file

Dates and versions

inria-00100664 , version 1 (26-09-2006)


  • HAL Id : inria-00100664 , version 1


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. ⟨inria-00100664⟩
174 View
0 Download


Gmail Facebook Twitter LinkedIn More