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.

PDF
RCRA_15_Sep_2009.pdf
Restricted to Repository staff only
Download (356kB) | Request a copy

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
Divisions:	Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng. Faculty of Engineering and Natural Sciences
Depositing User:	Esra Erdem
Date Deposited:	08 Mar 2010 11:23
Last Modified:	26 Apr 2022 08:55
URI:	https://research.sabanciuniv.edu/id/eprint/13805

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)
  - Comparing ASP and CP on four grid puzzles. (deposited 08 Mar 2010 11:23) [Currently Displayed]

Actions (login required)

: View Item