On minimal sets of graded attribute implications

DOI10.1016/J.INS.2014.09.059zbMATH Open1360.68849arXiv1405.7076OpenAlexW2062241014MaRDI QIDQ526697FDOQ526697

Vilem Vychodil

Publication date: 15 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Abstract: We explore the structure of non-redundant and minimal sets consisting of graded if-then rules. The rules serve as graded attribute implications in object-attribute incidence data and as similarity-based functional dependencies in a similarity-based generalization of the relational model of data. Based on our observations, we derive a polynomial-time algorithm which transforms a given finite set of rules into an equivalent one which has the least size in terms of the number of rules.

Full work available at URL: https://arxiv.org/abs/1405.7076

Recommendations

• On sets of graded attribute implications with witnessed non-redundancy
• Computing sets of graded attribute implications with witnessed non-redundancy
• BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
• AI 2005: Advances in Artificial Intelligence
• Derivation digraphs for dependencies in ordinal and similarity-based data

zbMATH Keywords

redundancyfuzzy logicminimalityresiduated latticeattribute implication

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Fuzzy logic; logic of vagueness (03B52) Database theory (68P15) Other algebras related to logic (03G25)

Cites Work

• The concept of a linguistic variable and its application to approximate reasoning. I
• The concept of a linguistic variable and its application to approximate reasoning. III
• On Fuzzy Logic I Many‐valued rules of inference
• The concept of a linguistic variable and its application to approximate reasoning. II
• Metamathematics of fuzzy logic
• Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
• The logic of inexact concepts
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Residuated lattices. An algebraic glimpse at substructural logics
• Formal concept analysis and linguistic hedges
• Title not available (Why is that?)
• Mathematical Fuzzy Logics
• On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
• On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Globalization of intuitionistic set theory
• On very true
• A logical approach to fuzzy truth hedges
• On the complexity of enumerating pseudo-intents
• Non-deterministic ideal operators: an adequate tool for formalization in data bases
• Fuzzy attribute logic over complete residuated lattices
• BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
• Title not available (Why is that?)
• Derivation digraphs for dependencies in ordinal and similarity-based data
• Decision implication canonical basis: a logical perspective

Cited In (6)

• AI 2005: Advances in Artificial Intelligence
• Title not available (Why is that?)
• Computing sets of graded attribute implications with witnessed non-redundancy
• On sets of graded attribute implications with witnessed non-redundancy
• BASIC ALGORITHM FOR ATTRIBUTE IMPLICATIONS AND FUNCTIONAL DEPENDENCIES IN GRADED SETTING
• Canonical dichotomous direct bases

This page was built for publication: On minimal sets of graded attribute implications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526697)