Research Articles (Mathematical Sciences)

Permanent URI for this collection

Now showing 1 - 2 of 2

Compactly generating all satisfying truth assignments of a horn formula
(Delft University in cooperation with IOS Press, 2012-01) Wild, Marcel
ENGLISH ABSTRACT: While it was known that all models of a Horn formula can be generated in outputpolynomial time, here we present an explicit algorithm as opposed to the rather vague oracle-scheme suggested in the proof of [6, Thm.4]. It is an instance of some principle of exclusion that compactly (thus not one by one) generates all models of certain Boolean formulae given in CNF. The principle of exclusion can be adapted to generate only the models of weight k. We compare and contrast it with constraint programming, 0; 1 integer programming, and binary decision diagrams.
Computing the output distribution of a stack filter from the DNF of its positive Boolean function
(Cornell University Library, 2010) Wild, Marcel
ENGLISH ABSTRACT: The majority of nonlinear filters used in practise are stack filters. An algorithm is presented which calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form (DNF) of its underlying positive Boolean function. The so called selection probabilities can be computed along the way.