Short Boolean formulas as explanations in practice

DOI10.1007/978-3-031-43619-2_7MaRDI QIDQ6545522zbMATH OpenFDO

Authors Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander

Publication date 29 May 2024

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

answer set programmingBoolean optimizationexplainabilityBoolean formula sizeinterpretable AIoverfitting error

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Explaining AI decisions using efficient methods for learning sparse Boolean formulae
• On the reasons behind decisions
• A logic for binary classifiers and their explanation
• Foundations of fine-grained explainability
• A SAT-based approach to learn explainable decision sets

Cites work

• scientific article; zbMATH DE number 1484400 (Why is no real title available?)
• scientific article; zbMATH DE number 1881110 (Why is no real title available?)
• A lower bound on the probability that a binomial random variable is exceeding its mean
• A theory of the learnable
• Advances in WASP
• Conflict-driven answer set solving: from theory to practice
• Learnability and the Vapnik-Chervonenkis dimension
• Occam's razor
• On the necessity of Occam algorithms
• Progress in clasp series 3

This page was built for publication: Short Boolean formulas as explanations in practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545522)