research
∙
02/14/2023
Reasoning on Feature Models: Compilation-Based vs. Direct Approaches
Analyzing a Feature Model (FM) and reasoning on the corresponding config...
share
research
∙
01/30/2023
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits
We consider the problem EnumIP of enumerating prime implicants of Boolea...
research
∙
09/16/2022
Computing Abductive Explanations for Boosted Trees
Boosted trees is a dominant ML model, exhibiting high accuracy. However,...
research
∙
06/17/2022
Rectifying Mono-Label Boolean Classifiers
We elaborate on the notion of rectification of a Boolean classifier Σ. G...
research
∙
02/11/2022
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
We are interested in computing k most preferred models of a given d-DNNF...
research
∙
08/23/2021
On Quantifying Literals in Boolean Logic and Its Applications to Explainable AI
Quantified Boolean logic results from adding operators to Boolean logic ...
research
∙
08/11/2021
Trading Complexity for Sparsity in Random Forest Explanations
Random forests have long been considered as powerful model ensembles in ...
research
∙
08/11/2021
On the Explanatory Power of Decision Trees
Decision trees have long been recognized as models of choice in sensitiv...
research
∙
04/13/2021
On the Computational Intelligibility of Boolean Classifiers
In this paper, we investigate the computational intelligibility of Boole...
research
∙
12/08/2020
On Irrelevant Literals in Pseudo-Boolean Constraint Learning
Learning pseudo-Boolean (PB) constraints in PB solvers exploiting cuttin...
research
∙
05/09/2020
On Weakening Strategies for PB Solvers
Current pseudo-Boolean solvers implement different variants of the cutti...
research
∙
10/24/2014
On the Complexity of Optimization Problems based on Compiled NNF Representations
Optimization is a key task in a number of applications. When the set of ...
research
∙
07/11/2002
