On sets of graded attribute implications with witnessed non-redundancy
From MaRDI portal
Publication:1750536
DOI10.1016/j.ins.2015.09.044zbMath1390.68682arXiv1505.04677OpenAlexW4233100965MaRDI QIDQ1750536
Publication date: 22 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04677
Fuzzy logic; logic of vagueness (03B52) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On minimal sets of graded attribute implications
- Fuzzy logic programming reduced to reasoning with attribute implications
- Derivation digraphs for dependencies in ordinal and similarity-based data
- Fuzzy Horn logic. II. Implicationally defined classes.
- Residuated lattices. An algebraic glimpse at substructural logics
- The multiple facets of the canonical direct unit implicational basis
- Globalization of intuitionistic set theory
- 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. II
- The concept of a linguistic variable and its application to approximate reasoning. III
- Triangular norms on product lattices
- Metamathematics of fuzzy logic
- Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
- On very true
- Triangular norms
- Optimizations in computing the Duquenne-Guigues basis of implications
- Multi-adjoint concept lattices with heterogeneous conjunctors and hedges.
- Triangular norm based predicate fuzzy logics
- A logical approach to fuzzy truth hedges
- Dual multi-adjoint concept lattices
- L-fuzzy sets
- The logic of inexact concepts
- Fuzzy Horn logic. I. Proof theory.
- Formal concept analysis and linguistic hedges
- Attribute dependencies for data with grades I,
- Fuzzy attribute logic over complete residuated lattices
- Mathematical Fuzzy Logics
- Two Basic Algorithms in Concept Analysis
- On Fuzzy Logic I Many‐valued rules of inference
- On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
- On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
- Functional Dependencies in a Relational Database and Propositional Logic
- Decomposition of a Data Base and the Theory of Boolean Switching Functions
- Fuzzy Closure Operators with Truth Stressers
- AI 2005: Advances in Artificial Intelligence
- Formal Concept Analysis
