Declaratively Solving Google Code Jam Problems with Picat

@inproceedings{Dymchenko2015DeclarativelySG,
  title={Declaratively Solving Google Code Jam Problems with Picat},
  author={Sergii Dymchenko and Mariia Mykhailova},
  booktitle={PADL},
  year={2015}
}
  • Sergii Dymchenko, Mariia Mykhailova
  • Published in PADL 2015
  • Computer Science
  • In this paper we present several examples of solving algorithmic problems from the Google Code Jam programming contest with Picat programming language using declarative techniques: constraint logic programming and tabled logic programming. In some cases the use of Picat simplifies the implementation compared to conventional imperative programming languages, while in others it allows to directly convert the problem statement into an efficiently solvable declarative problem specification without… CONTINUE READING
    Canonicalizing High-Level Constructs in Picat
    Programming in Picat

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES
    Coalescents and genealogical structure under neutrality.
    346
    A Method of Recognition of Arabic Cursive Handwriting
    175
    TopicNets: Visual Analysis of Large Text Corpora with Topic Modeling
    146
    Mammalian distal tubule: physiology, pathophysiology, and molecular anatomy.
    310
    Declaratively solving tricky google code jam problems with prolog-based ECLiPSe CLP system
    1
    Combinatorial Search With Picat
    9
    Solving several planning problems with Picat
    2
    The language features and architecture of B-Prolog
    69