Comparing ASP and CP on four grid puzzles
Mehmet Utku Celik, Halit Erdoğan, Fırat Hamit Tahaoğlu, Tansel Uras, Esra Erdem · Sabanci University · 2009
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 solution using ASP system Clasp and CP system Comet. We compare the ASP approach with CP approach both from the point of view of knowledge representation and from the point of view of computational time and memory.