Solving challenging grid puzzles with answer set programming

Warning The system is temporarily closed to updates for reporting purpose.

Çaylı, Merve and Karatop, Ayşe Gül and Kavlak, Ahmet Emrah and Kaynar, Hakan and Türe, Ferhan and Erdem, Esra (2007) Solving challenging grid puzzles with answer set programming. In: International Workshop on Answer Set Programming,

[thumbnail of puzzles-final.pdf] PDF
puzzles-final.pdf

Download (224kB)

Abstract

We study four challenging grid puzzles, Nurikabe, Heyawake, Masyu, Bag Puzzle, interesting for answer set programming (ASP) from the viewpoints of representation and computation: they show expressivity of ASP, they are good examples of a representation methodology, and they form a useful suite of benchmarks for evaluating/improving computational methods for nontight programs.
Item Type: Papers in Conference Proceedings
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Esra Erdem
Date Deposited: 26 Oct 2007 16:42
Last Modified: 26 Apr 2022 08:40
URI: https://research.sabanciuniv.edu/id/eprint/5086

Actions (login required)

View Item
View Item