Comparing ASP and CP on four grid puzzles
作者： Tansel Uras , Fırat Hamit Tahaoğlu , Halit Erdoğan , Esra Erdem , Mehmet Çelik
DOI:
关键词:
摘要: We study two declarative programming languages namely Answer Set Programming (ASP) and Constraint (CP) on four grid puzzles: Akari, Kakuro, Nurikabe, Heyawake. represent these problems in both formalisms a systematic way compute their solutions using ASP system Clasp CP Comet. compare the approach with from point of view knowledge representation computational time memory.
参考文章(8)
Helmut Simonis, Sudoku as a Constraint Problem ,(2005)
Graham Kendall, Andrew Parkes, Kristian Spoerer, None, A SURVEY OF NP-COMPLETE PUZZLES ICGA Journal. ,vol. 31, pp. 13- 34 ,(2008) , 10.3233/ICG-2008-31103
Agostino Dovier, Enrico Pontelli, Andrea Formisano, An experimental comparison of constraint logic programming and answer set programming national conference on artificial intelligence. pp. 1622- 1625 ,(2007)
Ferhan Türe, Esra Erdem, Ahmet Emrah Kavlak, Hakan Kaynar, Merve Çaylı, Ayşe Gül Karatop, Solving challenging grid puzzles with answer set programming Universidade do Porto, Faculdade de Ciencias. ,(2007)
Markus Holzer, Oliver Ruepp, The troubles of interior design: a complexity analysis of the game Heyawake fun with algorithms. pp. 198- 212 ,(2007) , 10.1007/978-3-540-72914-3_18
Gregoire Dooms, Yves Deville, Pierre Dupont, CP(Graph): Introducing a Graph Computation Domain in Constraint Programming Principles and Practice of Constraint Programming - CP 2005. ,vol. 3709, pp. 211- 225 ,(2005) , 10.1007/11564751_18
Ferhan Türe, Esra Erdem, Elvin Çoban, Comparing ASP, CP, ILP on two challenging applications: wire routing and haplotype inference Katholieke Universiteit Leuven. ,(2008)
Toni Mancini, Davide Micaletto, Fabio Patrizi, Marco Cadoli, Evaluating ASP and commercial solvers on the CSPLib european conference on artificial intelligence. ,vol. 13, pp. 407- 436 ,(2008) , 10.1007/S10601-007-9028-6