Dualization of a monotone Boolean function represented by a conjunctive normal form
(CNF) is a problem which, in different disguise, is ubiquitous in many areas including …

Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

One of the basic problems in knowledge discovery in databases (KDD) is the following:
given a data set r, a class L of sentences for defining subgroups of r, and a selection …

We consider the problem of testing sequentially the components of a multi-component
system in order to learn the state of the system, when the tests are costly. In this review …

On the Complexity of Dualization of Monotone Disjunctive Normal Forms Page 1 Ž . JOURNAL
OF ALGORITHMS 21, 618628 1996 ARTICLE NO. 0062 On the Complexity of Dualization of …

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 …

Decision trees have long been recognized as models of choice in sensitive applications
where interpretability is of paramount importance. In this paper, we examine the …

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 …

Mobile data traffic is increasing astronomically. This enormous extent was not only caused
by the increasing in the number of mobile devices, but also the growing number of …

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