BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
From MaRDI portal
Recommendations
- Graded LinClosure and Its Role in Relational Data Analysis
- Computing sets of graded attribute implications with witnessed non-redundancy
- On minimal sets of graded attribute implications
- AI 2005: Advances in Artificial Intelligence
- On sets of graded attribute implications with witnessed non-redundancy
Cites work
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 1183717 (Why is no real title available?)
- Fuzzy Closure Operators with Truth Stressers
- Fuzzy attribute logic over complete residuated lattices
- Globalization of intuitionistic set theory
- On Fuzzy Logic I Many‐valued rules of inference
- On very true
Cited in
(9)- Attribute dependencies for data with grades I,
- AI 2005: Advances in Artificial Intelligence
- Computing sets of graded attribute implications with witnessed non-redundancy
- On sets of graded attribute implications with witnessed non-redundancy
- Graded LinClosure and Its Role in Relational Data Analysis
- Closure via functional dependence simplification
- Automated prover for attribute dependencies in data with grades
- Formal concept analysis approach to understand digital evidence relationships
- On minimal sets of graded attribute implications
This page was built for publication: BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526976)