Explainability via short formulas: the case of propositional logic with implementation

DOI10.1613/JAIR.1.17422MaRDI QIDQ6912794zbMATH OpenFDO

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

Publication date 22 October 2025

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1613/JAIR.1.17422

zbMATH Keywords

explainabilitylogic programmingmathematical foundationspropositional logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic programming (68N17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

Cites work

• A new class of explanations for classifiers with non-binary features
• Extending and implementing the stable model semantics
• Modal logic
• On the computational cost of disjunctive logic programming: Propositional case
• Random forests
• Short Boolean formulas as explanations in practice
• Stable-unstable semantics: Beyond NP with normal logic programs
• The complexity of Boolean formula minimization
• The minimum equivalent DNF problem and shortest implicants
• Writing declarative specifications for clauses

Cited in

(1)

• Descriptive complexity for neural networks via Boolean networks

This page was built for publication: Explainability via short formulas: the case of propositional logic with implementation

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