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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Gebser, M., Kaufmann, B., & Schaub, T. (2009). Solution enumeration for projected boolean search problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5547 LNCS, pp. 71–86). https://doi.org/10.1007/978-3-642-01929-6_7
Mendeley helps you to discover research relevant for your work.