Comparing ASP and CP on four grid puzzles. Celik, M., Erdogan, H., Tahaoglu, F., Uras, T., & Erdem, E. In Proc. of the 16th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'09), 2009. Paper N abstract bibtex 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 solutions using ASP system Clasp and CP system Comet. We compare the ASP approach with the CP approach both from the point of view of knowledge representation and from the point of view of computational time and memory.
@inproceedings{rcra09,
author = {Mehmet Celik and Halit Erdogan and Firat Tahaoglu and Tansel Uras and Esra Erdem},
title = {{Comparing ASP and CP on four grid puzzles}},
booktitle = {Proc. of the 16th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'09)},
year = {2009},
url = {http://krr.sabanciuniv.edu/projects/gridpuzzle/},
urlN = {rcra09.pdf},
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 solutions using ASP system Clasp and CP system Comet. We
compare the ASP approach with the CP approach both from the point
of view of knowledge representation and from the point of view of
computational time and memory.},
}
Downloads: 0
{"_id":{"_str":"534224d0ecd21cdc070007c7"},"__v":29,"authorIDs":["5456f0758b01c81930000081","545729f72abc8e9f3700012a","54597963b43425b7720005c1","5472469b5ac8e5e30d000cdc","5df0b7a08367c8de010000ce","5df87bbedb7d9ddf01000044","5e4957a916841dde01000031","u493trvfaXuB4g9PZ"],"author_short":["Celik, M.","Erdogan, H.","Tahaoglu, F.","Uras, T.","Erdem, E."],"bibbaseid":"celik-erdogan-tahaoglu-uras-erdem-comparingaspandcponfourgridpuzzles-2009","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Mehmet"],"propositions":[],"lastnames":["Celik"],"suffixes":[]},{"firstnames":["Halit"],"propositions":[],"lastnames":["Erdogan"],"suffixes":[]},{"firstnames":["Firat"],"propositions":[],"lastnames":["Tahaoglu"],"suffixes":[]},{"firstnames":["Tansel"],"propositions":[],"lastnames":["Uras"],"suffixes":[]},{"firstnames":["Esra"],"propositions":[],"lastnames":["Erdem"],"suffixes":[]}],"title":"Comparing ASP and CP on four grid puzzles","booktitle":"Proc. of the 16th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'09)","year":"2009","url":"http://krr.sabanciuniv.edu/projects/gridpuzzle/","urln":"rcra09.pdf","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 solutions using ASP system Clasp and CP system Comet. We compare the ASP approach with the CP approach both from the point of view of knowledge representation and from the point of view of computational time and memory.","bibtex":"@inproceedings{rcra09,\n author = {Mehmet Celik and Halit Erdogan and Firat Tahaoglu and Tansel Uras and Esra Erdem},\n title = {{Comparing ASP and CP on four grid puzzles}},\n booktitle = {Proc. of the 16th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'09)},\n year = {2009},\n url = {http://krr.sabanciuniv.edu/projects/gridpuzzle/},\n urlN = {rcra09.pdf},\n abstract = {We study two declarative programming languages namely Answer\nSet Programming (ASP) and Constraint Programming (CP) on four\ngrid puzzles: Akari, Kakuro, Nurikabe, and Heyawake. We represent\nthese problems in both formalisms in a systematic way and compute\ntheir solutions using ASP system Clasp and CP system Comet. We\ncompare the ASP approach with the CP approach both from the point\nof view of knowledge representation and from the point of view of\ncomputational time and memory.},\n}\n\n","author_short":["Celik, M.","Erdogan, H.","Tahaoglu, F.","Uras, T.","Erdem, E."],"key":"rcra09","id":"rcra09","bibbaseid":"celik-erdogan-tahaoglu-uras-erdem-comparingaspandcponfourgridpuzzles-2009","role":"author","urls":{"Paper":"http://krr.sabanciuniv.edu/projects/gridpuzzle/","N":"http://pages.cs.wisc.edu/~halit/papers/rcra09.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://pages.cs.wisc.edu/~halit/papers/haliterdoganpub.bib","downloads":3,"keywords":[],"search_terms":["comparing","asp","four","grid","puzzles","celik","erdogan","tahaoglu","uras","erdem"],"title":"Comparing ASP and CP on four grid puzzles","year":2009,"dataSources":["h6pbJnSkCa6JsKHC7","FnnA3hAZggjATcKDh"]}