253 research outputs found
Compactly generating all satisfying truth assignments of a Horn formula
As instance of an overarching principle of exclusion an algorithm is
presented that compactly (thus not one by one) generates all models of a Horn
formula. The principle of exclusion can be adapted to generate only the models
of weight . We compare and contrast it with constraint programming,
integer programming, and binary decision diagrams.Comment: Considerably improves upon the readibility of the previous versio
Unsolvability Certificates for Classical Planning
The plans that planning systems generate for solvable planning tasks are routinely verified by independent validation tools. For unsolvable planning tasks, no such validation capabilities currently exist. We describe a family of certificates of unsolvability for classical planning tasks that can be efficiently verified and are sufficiently general for a wide range of planning approaches including heuristic search with delete relaxation, critical-path, pattern database and linear merge-and-shrink heuristics, symbolic search with binary decision diagrams, and the Trapper algorithm for detecting dead ends. We also augmented a classical planning system with the ability to emit certificates of unsolvability and implemented a planner-independent certificate validation tool. Experiments show that the overhead for producing such certificates is tolerable and that their validation is practically feasible
Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function
Many 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.Comment: This is the version published in Journal of Mathematical Imaging and
Vision, online first, 1 august 201
- …