# Declaratively solving Google Code Jam problems with Picat

arXiv: https://arxiv.org/abs/1504.00977 · HTML: https://mlsanity.com/paper/1504.00977/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Apr 2015.

## Built on by (most cited first, 1 of 1)

- [Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat](https://mlsanity.com/paper/2109.08293/) (2021)

## Abstract (arXiv)

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 inventing an imperative algorithm.