Required-edge Cycle Cover Problem: an ASP-Completeness Framework for Graph Problems and Puzzles
This paper introduces the Required-edge Cycle Cover Problem (RCCP) and a corresponding flow model to establish an ASP-completeness framework that resolves open complexity questions for Constraint Graph Satisfiability and Kakuro while proving the ASP-completeness of several other pencil-and-paper puzzles.