• Publications
  • Influence
Discovery of optimal factors in binary data via a novel method of matrix decomposition
We present a novel method of decomposition of an nxm binary matrix I into a Boolean product A@?B of nxk binary matrix A and a kxmbinary matrix B with k as small as possible. Expand
Parallel Recursive Algorithm for FCA
This paper presents a parallel algorithm for computing formal concepts in binary object-attribute relational data. Expand
What is a fuzzy concept lattice?
The paper is an overview of several approaches to the notion of a concept lattice from the point of view of fuzzy logic. Expand
Reducing the Size of Fuzzy Concept Lattices by Hedges
We study concept lattices with hedges. The principal aim is to control, in a parametrical way, the size of a concept lattice. The paper presents theoretical insight, comments, and examples. We showExpand
Truth-depressing hedges and BL-logic
  • V. Vychodil
  • Mathematics, Computer Science
  • Fuzzy Sets Syst.
  • 1 August 2006
We show a complete axiomatization of unary connectives interpreted by monotone and superdiagonal truth functions, so-called truth-depressing hedges. Expand
Fuzzy Equational Logic
Presented is a completeness theorem for fuzzy equational logic with truth values in a complete residuated lattice. Expand
Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
We propose efficient algorithm for listing all fixpoints of Galois connections induced by object-attribute data. Expand
Computing the Lattice of All Fixpoints of a Fuzzy Closure Operator
We present a fast bottom-up algorithm to compute all fixpoints of a fuzzy closure operator in a finite set over a finite chain of truth degrees, along with the partial order on the set of allfixpoints. Expand
Attribute Implications in a Fuzzy Setting
The paper is an overview of recent developments concerning attribute implications in a fuzzy setting, which describe dependencies between attributes. Expand
Data Tables with Similarity Relations: Functional Dependencies, Complete Rules and Non-redundant Bases
We study rules $A \Longrightarrow B$ describing attribute dependencies in tables over domains with similarity relations. Expand