Sciweavers

Share
SAC
2015
ACM

Declaratively solving tricky google code jam problems with prolog-based ECLiPSe CLP system

3 years 5 months ago
Declaratively solving tricky google code jam problems with prolog-based ECLiPSe CLP system
In this paper we demonstrate several examples of solving challenging algorithmic problems from the Google Code Jam programming contest with the Prolog-based ECLi PSe system using declarative techniques: constraint logic programming and linear (integer) programming. These problems were designed to be solved by inventing clever algorithms and efficiently implementing them in a conventional imperative programming language, but we present relatively simple declarative programs in ECLi PSe that are fast enough to find answers within the time limit imposed by the contest rules. We claim that declarative programming with ECLi PSe is better suited for solving certain common kinds of programming problems offered in Google Code Jam than imperative programming. We show this by comparing the mental steps required to come up with both kinds of solutions. Categories and Subject Descriptors D.3.2 [Programming Languages]: Language Classifica
Sergii Dymchenko, Mariia Mykhailova
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where SAC
Authors Sergii Dymchenko, Mariia Mykhailova
Comments (0)
books