Decision trees (DTs) epitomize the ideal of interpretability of machine learning (ML) models.
The interpretability of decision trees motivates explainability approaches by so-called …

The last decade witnessed an ever-increasing stream of successes in Machine Learning
(ML). These successes offer clear evidence that ML is bound to become pervasive in a wide …

Recent work has shown that not only decision trees (DTs) may not be interpretable but also
proposed a polynomial-time algorithm for computing one PI-explanation of a DT. This paper …

Quantified Boolean logic results from adding operators to Boolean logic for existentially and
universally quantifying variables. This extends the reach of Boolean logic by enabling a …

Network structures and models have been widely adopted, eg, for Internet of Things,
wireless sensor networks, smart grids, transportation networks, communication networks …

A hypergraph ℱ is a set family defined on vertex set V. The dual of ℱ is the set of minimal
subsets H of V such that F∩ H≠ ø for any F∊ F. The computation of the dual is equivalent to …

Finding inclusion-minimal hitting sets (MHSs) for a given family of sets is a fundamental
combinatorial problem with applications in domains as diverse as Boolean algebra …

The frame approach for representing knowledge (ie, collection of frames are linked together
into frame-system) has been suggested by Marvin Minsky. In this approach, the frame …

A dominating set D in a graph is a subset of its vertex set such that each vertex is either in D
or has a neighbor in D. In this paper, we are interested in the enumeration of (inclusionwise) …

Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently
compute the minimal knock-out sets of reactions required to block a given behavior. We …