The problem of reconstructing the and-or expression of a partially defined positive Boolean
function (pdpBf) is solved by adopting a novel algorithm, denoted by LSC, which combines …

The problem of reconstructing the AND-OR expression of a positive Boolean function
starting from a portion of its truth table is solved by adopting a proper algorithm, called …

We consider to identify an unknown Boolean function f by asking an oracle the functional
values f (a) for a selected set of test vectors a ε {0, 1} n. If f is known to be a positive function …

We model a given pair of sets of positive and negative examples, each of which may contain
missing components, as a partially defined Boolean function with missing bits (pBmb)(T …

This note illustrates a theoretical worst-case scenario for groundness analyses obtained
through abstract interpretation over the abstract domain of positive Boolean functions. A …

As a form of knowledge acquisition from data, we consider the problem which, given a
partially de ned Boolean function with missing data (pBmd)(~ T;~ F), where~ T f0; 1; gn and …

Consider the problem of identifying minT (f) and maxF (f) of a positive (ie, monotone)
Boolean functionf, by using membership queries only, where minT (f)(maxF (f)) denotes the …

In a finite dataset consisting of positive and negative observations represented as real
valued n-vectors, a positive (negative) pattern is an interval in Rn with the property that it …

Boolean matrix has been used to represent digital information in many fields, including bank
transaction, crime records, natural language processing, protein-protein interaction, etc …

As a form of knowledge acquisition from data, we consider the problem of deciding whether
there exists an extension of a partially defined Boolean function with missing data (̃ T, ̃ F) …