Closures of database hypergraphs
Journal of the ACM (JACM)
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficient mining of association rules using closed itemset lattices
Information Systems
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
Graph Algorithms for Functional Dependency Manipulation
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM - Special 25th Anniversary Issue
Fuzzy logic: mathematical tools for approximate reasoning
Fuzzy logic: mathematical tools for approximate reasoning
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Fuzzy Relational Systems: Foundations and Principles
Fuzzy Relational Systems: Foundations and Principles
Mining Non-Redundant Association Rules
Data Mining and Knowledge Discovery
Theory of Relational Databases
Theory of Relational Databases
On Proofs and Rule of Multiplication in Fuzzy Attribute Logic
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Residuated Lattices: An Algebraic Glimpse at Substructural Logics, Volume 151
Residuated Lattices: An Algebraic Glimpse at Substructural Logics, Volume 151
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Codd's Relational Model from the Point of View of Fuzzy Logic
Journal of Logic and Computation
Attribute implications in a fuzzy setting
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Dual multi-adjoint concept lattices
Information Sciences: an International Journal
A logical approach to fuzzy truth hedges
Information Sciences: an International Journal
Association discovery from relational data via granular computing
Information Sciences: an International Journal
| Hi-index | 0.07 |
We present graph-based method of reasoning with if-then rules describing dependencies between attributes in ordinal and similarity-based data. The rules we consider have two basic interpretations as attribute implications in object-attribute incidence data where objects are allowed to have attributes (features) to degrees and as similarity-based functional dependencies in an extension of the Codd model of data. Main results in this paper show that degrees to which if-then rules are semantically entailed from sets (or graded sets) of other if-then rules can be characterized by existence of particular directed acyclic graphs with vertices labeled by attributes and degrees coming from complete residuated lattices. In addition, we show that the construction of directed acyclic graphs can be used to compute closures of sets of attributes and normalized proofs.