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

@inproceedings{Dymchenko2015DeclarativelyST,
  title={Declaratively solving tricky google code jam problems with prolog-based ECLiPSe CLP system},
  author={Sergii Dymchenko and Mariia Mykhailova},
  booktitle={SAC},
  year={2015}
}
  • Sergii Dymchenko, Mariia Mykhailova
  • Published in SAC 2015
  • Computer Science
  • In this paper we demonstrate several examples of solving challenging algorithmic problems from the Google Code Jam programming contest with the Prolog-based ECLiPSe 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 ECLiPSe that are… CONTINUE READING
    Declaratively Solving Google Code Jam Problems with Picat
    • 3
    • PDF

    References

    Publications referenced by this paper.
    ECLiPSe – from LP to CLP. Theory Pract
    • 2012