Comparing ASP and CP on four grid puzzles

Çelik, Mehmet and Erdoğan, Halit and Tahaoğlu, Fırat Hamit and Uras, Tansel and Erdem, Esra (2009) Comparing ASP and CP on four grid puzzles. In: 16th RCRA International Workshop on "Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion" (RCRA 2009), Reggio Emilia, Italy

This is the latest version of this item.

[img]PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader


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.

Item Type:Papers in Conference Proceedings
ID Code:13805
Deposited By:Esra Erdem
Deposited On:08 Mar 2010 11:23
Last Modified:24 Jul 2019 16:12

Available Versions of this Item

Repository Staff Only: item control page