Copyright © 2005 Elsevier B.V. All rights reserved.
Computing the minimum DNF representation of Boolean functions defined by intervals
Received 17 May 2002;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
For any two n-bit numbers a
b define the Boolean function f[a,b]:{0,1}n→{0,1} to be the function for which f[a,b](x)=1 if and only if x is the binary representation of a number in the interval [a,b]. We consider the disjunctive normal form representation of such functions, and show how to compute such a representation with a minimum number of disjuncts in linear time. We also show how to compute a minimum “disjoint” representation; i.e., a representation in which the domains of the disjuncts are mutually disjoint. The minimum disjunctive normal form can be applied to devise efficient constraint satisfaction systems for automatic generation of test patterns.
Keywords: Constraint satisfaction; Automatic test generation; Boolean function; DNF; Disjunctive normal form






E-mail Article
Add to my Quick Links

Cited By in Scopus (3)





