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: The 16th RCRA International Workshop on "Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion" (RCRA 2009), Italy (Accepted/In Press)

There is a more recent version of this item available.

PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
348Kb

Abstract

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
Subjects:	UNSPECIFIED
ID Code:	12360
Deposited By:	Esra Erdem
Deposited On:	01 Nov 2009 19:31
Last Modified:	08 Mar 2010 11:23

Available Versions of this Item

Comparing ASP and CP on four grid puzzles. (deposited 01 Oct 2009 16:55)
- Comparing ASP and CP on four grid puzzles. (deposited 01 Nov 2009 19:31) [Currently Displayed]
  - Comparing ASP and CP on four grid puzzles. (deposited 08 Mar 2010 11:23)

Repository Staff Only: item control page