GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Constraint Processing
Solving Optimization Problems with DLL
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Using more reasoning to improve #SAT solving
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conflict-driven answer set enumeration
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
A lightweight component caching scheme for satisfiability solvers
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Metabolic Network Expansion with Answer Set Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
The Conflict-Driven Answer Set Solver clasp: Progress Report
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Making Your Hands Dirty Inspires Your Brain! Or How to Switch ASP into Production Mode
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Exact cover via satisfiability: an empirical study
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
Detecting inconsistencies in large biological networks with answer set programming
Theory and Practice of Logic Programming
Pushing efficient evaluation of HEX programs by modular decomposition
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
New approaches to boolean quantifier elimination
ACM Communications in Computer Algebra
Algorithm selection and scheduling
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
On minimal constraint networks
Artificial Intelligence
| Hi-index | 0.00 |
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.