no code implementations • 5 Nov 2015 • Vilem Vychodil
As a consequence, we solve the open problem regarding the existence of general systems of pseudo-intents which appear in formal concept analysis of object-attribute data with graded attributes and linguistic hedges.
no code implementations • 18 May 2015 • Vilem Vychodil
We introduce notions of saturation and witnessed non-redundancy of sets of graded attribute implications are show that bases of graded attribute implications given by systems of pseudo-intents correspond to non-redundant sets of graded attribute implications with saturated consequents where the non-redundancy is witnessed by antecedents of the contained graded attribute implications.
no code implementations • 11 Dec 2014 • Jan Triska, Vilem Vychodil
We investigate decidability and complexity issues of the logic and prove that the entailment problem is NP-hard and belongs to EXPSPACE.
no code implementations • 25 Oct 2014 • Vilem Vychodil
We study the semantics of fuzzy if-then rules called fuzzy attribute implications parameterized by systems of isotone Galois connections.
no code implementations • 8 Aug 2014 • Vilem Vychodil
We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra.
no code implementations • 27 May 2014 • Vilem Vychodil
We explore the structure of non-redundant and minimal sets consisting of graded if-then rules.