Comparing ASP and CP on four grid puzzles. Celik, M., Erdogan, H., Tahaoglu, F., Uras, T., & Erdem, E. In Proc. of the 16th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'09), 2009.
Comparing ASP and CP on four grid puzzles [link]Paper  Comparing ASP and CP on four grid puzzles [pdf]N  abstract   bibtex   
We study two declarative programming languages namely Answer Set Programming (ASP) and Constraint Programming (CP) on four grid puzzles: Akari, Kakuro, Nurikabe, and Heyawake. We represent these problems in both formalisms in a systematic way and compute their solutions using ASP system Clasp and CP system Comet. We compare the ASP approach with the CP approach both from the point of view of knowledge representation and from the point of view of computational time and memory.

Downloads: 0