Short Boolean formulas as explanations in practice

DOI10.1007/978-3-031-43619-2_7MaRDI QIDQ6545522FDOQ6545522

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

Publication date: 29 May 2024

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

zbMATH Keywords

answer set programmingBoolean optimizationexplainabilityBoolean formula sizeinterpretable AIoverfitting error

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Advances in WASP
• Title not available (Why is that?)
• Learnability and the Vapnik-Chervonenkis dimension
• Conflict-driven answer set solving: from theory to practice
• A theory of the learnable
• Occam's razor
• A lower bound on the probability that a binomial random variable is exceeding its mean
• On the necessity of Occam algorithms
• Title not available (Why is that?)
• 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)