Sciweavers

Share
CPAIOR
2009
Springer

Solution Enumeration for Projected Boolean Search Problems

12 years 10 hour ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts of a solution are needed. We are thus interested in projecting solutions to a restricted vocabulary. Yet, the adaption of Boolean constraint solving algorithms turns out to be non-obvious provided one wants a repetition-free enumeration in polynomial space. We address this problem and propose a new algorithm computing projective solutions. Although we have implemented our approach in the context of Answer Set Programming, it is readily applicable to any solver based on modern Boolean constraint technology.
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where CPAIOR
Authors Martin Gebser, Benjamin Kaufmann, Torsten Schaub
Comments (0)
books