论文信息 - CAISL: Simplification Logic for Conditional Attribute Implications

CAISL: Simplification Logic for Conditional Attribute Implications

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.

Rokia Missaoui | Pablo Cordero | Manuel Enciso | Estrella Rodríguez Lorenzo | Angel Mora

[1] Rokia Missaoui,et al. An Axiomatic System for Conditional Attribute Implications in Triadic Concept Analysis , 2017, Int. J. Intell. Syst..

[2] G. L.. Collected Papers , 1912, Nature.

[3] Rudolf Wille,et al. A Triadic Approach to Formal Concept Analysis , 1995, ICCS.

[4] Andreas Hotho,et al. TRIAS--An Algorithm for Mining Iceberg Tri-Lattices , 2006, Sixth International Conference on Data Mining (ICDM'06).

[5] Bernhard Ganter,et al. Implications in Triadic Formal Contexts , 2004, ICCS.

[6] Klaus Biedermann. Powerset Trilattices , 1998, ICCS.

[7] Rokia Missaoui,et al. Mining Triadic Association Rules from Ternary Relations , 2011, ICFCA.

[8] Ronald Fagin,et al. Functional Dependencies in a Relational Data Base and Propositional Logic , 1977, IBM J. Res. Dev..

[9] Klaus Biedermann,et al. How Triadic Diagrams Represent Conceptual Structures , 1997, ICCS.

[10] David Maier,et al. The Theory of Relational Databases , 1983 .

[11] Angel Mora,et al. SLFD Logic: Elimination of Data Redundancy in Knowledge Representation , 2002, IBERAMIA.

[12] W. W. Armstrong,et al. Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[13] Rudolf Wille,et al. The Basic Theorem of triadic concept analysis , 1995 .