Termination and nontermination of infinite-state systems are complementary problems that, despite their close connection, are typically addressed by separate techniques. The core idea of this paper is to connect termination and nontermination analysis, enabling the two to share intermediate results and guide one anothe...
Konstantin Britikov, Martin Blicha, Grigory Fedyukovich et al.· 0 citations
This paper addresses formal explainability of classifying neural networks by introducing a flexible symbolic framework for an efficient, guided computation of explanations of the NN behavior, parametrized by the activations of internal neurons, and using logical engines such as SMT solvers.
Tomáš Kolárik, Faezeh Labbaf, Fabrizio Leopardi et al.· 0 citations
This work introduces space explanations, a logic-based notion of explanation that represents sufficient conditions for a neural network to predict a given class over a (potentially large and geometrically complex) subset of the feature space and demonstrates that the interpolation-based explanations are more meaningful...
Faezeh Labbaf, Tomáš Kolárik, Martin Blicha et al.· CI-BD-SOQE@FLoC· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.