Search Results for author:
Found 4 papers, 1 papers with code
Verifying Properties of Tsetlin Machines
Then, we show the correctness of our encoding and provide results for the properties: adversarial robustness, equivalence, and similarity of TsMs.
Extracting Rules from Neural Networks with Partial Interpretations
We investigate the problem of extracting rules, expressed in Horn logic, from neural network models.
On the Learnability of Possibilistic Theories
We investigate learnability of possibilistic theories from entailments in light of Angluin's exact learning model.
Learning Query Inseparable ELH Ontologies
', with A an arbitrary data instance and q and query in Q.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
