Abstract
In this work, we present a sound and complete axiomatic system for conditional attribute implications (CAI s) in Triadic Concept Analysis (TCA). Our approach is strongly based on the Simplification paradigm which offers a more suitable way for automated reasoning than the one based on Armstrong’s Axioms. We also present an automated method to prove the derivability of a CAI from a set of CAI s.
Citation
Please, cite this work as:
[Rod+16] E. Rodr', P. Cordero, M. Enciso, et al. “CAISL: Simplification Logic for Conditional Attribute Implications”. In: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, Moscow, Russia, July 18-22, 2016. Ed. by M. Huchard and S. O. Kuznetsov. Vol. 1624. CEUR Workshop Proceedings. CEUR-WS.org, 2016, pp. 337-348. URL: https://ceur-ws.org/Vol-1624/paper26.pdf.
@InProceedings{Lorenzo2016,
author = {Estrella Rodr'Lorenzo and Pablo Cordero and Manuel Enciso and Rokia Missaoui and {’A}ngel Mora},
booktitle = {Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, Moscow, Russia, July 18-22, 2016},
title = {{CAISL:} Simplification Logic for Conditional Attribute Implications},
year = {2016},
editor = {Marianne Huchard and Sergei O. Kuznetsov},
pages = {337–348},
publisher = {CEUR-WS.org},
series = {{CEUR} Workshop Proceedings},
volume = {1624},
abstract = {In this work, we present a sound and complete axiomatic system for conditional attribute implications (CAI s) in Triadic Concept
Analysis (TCA). Our approach is strongly based on the Simplification paradigm which offers a more suitable way for automated reasoning than the one based on Armstrong’s Axioms. We also present an automated method to prove the derivability of a CAI from a set of CAI s.},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://dblp.org/rec/conf/cla/LorenzoCEMB16.bib},
timestamp = {Fri, 10 Mar 2023 00:00:00 +0100},
url = {https://ceur-ws.org/Vol-1624/paper26.pdf},
}