Abstract
Sets of attribute implications may have a certain degree of redundancy and the notion of basis appears as a way to characterize the implication set with less redundancy. The most widely accepted is the Duquenne-Guigues basis, strongly based on the notion of pseudo-intents. In this work we propose the minimal generators as an element to remove redundancy in the basis. The main problem is to enumerate all the minimal generators from a set of implications. We introduce a method to compute all the minimal generators which is based on the Simplification Rule for implications. The simplification paradigm allows us to remove redundancy in the implications by deleting attributes inside the implication without removing the whole implication itself. In this work, the application of the Simplification Rule to the set of implications guides the search of the minimal generators in a logic-based style, providing a deterministic approach.
Citation
Please, cite this work as:
[Cor+12] P. Cordero, M. Enciso, Á. Mora, et al. “Computing Minimal Generators from Implications: a Logic-guided Approach”. In: Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, Fuengirola (Málaga), Spain, October 11-14, 2012. Ed. by L. Szathmary and U. Priss. Vol. 972. CEUR Workshop Proceedings. CEUR-WS.org, 2012, pp. 187-198. URL: https://ceur-ws.org/Vol-972/paper16.pdf.
@InProceedings{Cordero2012a,
author = {Pablo Cordero and Manuel Enciso and {’A}ngel Mora and Manuel Ojeda-Aciego},
booktitle = {Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, Fuengirola (M{'{a}}laga), Spain, October 11-14, 2012},
title = {Computing Minimal Generators from Implications: a Logic-guided Approach},
year = {2012},
editor = {Laszlo Szathmary and Uta Priss},
pages = {187–198},
publisher = {CEUR-WS.org},
series = {{CEUR} Workshop Proceedings},
volume = {972},
abstract = {Sets of attribute implications may have a certain degree of redundancy and the notion of basis appears as a way to characterize the
implication set with less redundancy. The most widely accepted is the Duquenne-Guigues basis, strongly based on the notion of pseudo-intents. In this work we propose the minimal generators as an element to remove redundancy in the basis. The main problem is to enumerate all the minimal generators from a set of implications. We introduce a method to compute all the minimal
generators which is based on the Simplification Rule for implications. The simplification paradigm allows us to remove redundancy in the implications by deleting attributes inside the implication without removing the whole implication itself. In this work, the application of the Simplification Rule to the set of implications guides the search of the minimal generators in a logic-based style, providing a deterministic approach.},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://dblp.org/rec/conf/cla/CorderoEMO12.bib},
timestamp = {Fri, 10 Mar 2023 16:22:10 +0100},
url = {https://ceur-ws.org/Vol-972/paper16.pdf},
}