Tsetlin Machines (TsMs) are a promising and interpretable machine learni...
We investigate the problem of extracting rules, expressed in Horn logic,...
In Formal Concept Analysis, a base for a finite structure is a set of
im...
We investigate learnability of possibilistic theories from entailments i...
We investigate the complexity of learning query inseparable ontologies
...
share