The LP/CP programming contest will be run from 7:00PM to 9:00PM (New York time) on October 18 at the 
32nd International Conference on Logic Programming 
, New York City, USA This programming contest combines the ideas of the Prolog programming contest, the ASP model & solve contest, IDP system and the Minizinc model & solve contest.

The LP/CP programming contest consists of two tracks: one on-site track and one online track (the online track will be open for submissions for 24 hours). For both tracks, each team can consist of up to three participants, and each team may only use a single LP/CP system. For the on-site track, each team can use at most TWO computers. For the online track, there is no limit to the number of computers that can be used.

Report: Contest Report 

Contest Problems 

Submission page:

Each program is submitted as a "paper", in which the title has the form Track:LastNamesConcatenated:SystemName:FileName (e.g., onsite:FodorWeinzierl:xsb:prog1), the authors are the team members and the abstract contains the program. No attachments are allowed. A team may resubmit their program by updating the submission's information (the time of the last submission is considered for ranking). For each problem, only the final submission will be counted. 

For the on-site track, submission on a USB stick is also acceptable if there is no Internet or Easychair access (the time of the submission will be saved). In this case, the program must be saved in the USB stick with the designated name.

Each team is given 2 hours to solve 5 programming problems. Each team must submit solutions as programs in their chosen language. For each problem, a submitted program must have the main name as specified by the problem description, and the extension name must correctly indicate the used language. For ASP the extension is “.asp”; for Minizinc the extension is ".mzn"; for Prolog the extension name is “.pl”; for XSB the extension name is “.P”; and for Picat the extension is “.pi”.

One of the following systems can be used: 

If a team wants to use any other system, the team must contact the organizers in advance, offer assistance in installing and testing the system, and provide solutions for the sample problems.  

Sample Problems and Solutions

Problem Statement SWI-Prolog SICStus Prolog Ciao Prolog ECLiPSe Prolog XSB Prolog Potassco Picat  MiniZinc  IDP 
Blocked Queens
Blocked SWI
Blocked SICStus
Blocked Ciao Blocked ECLiPSe
Blocked XSB
Blocked clingo
 Blocked Picat  Blocked Minizinc  Blocked IDP
Meeting Point
Meeting Point SWI
Meeting Point SICStus
Meeting Point Ciao Meeting Point ECLiPSe
Meeting Point XSB Meeting Point Clingo
Meeting Point Picat
 Meeting Point Minizinc  Meeting Point IDP

For each problem, a set of instances is used to test submitted programs. A smaller set of the test instances and their sample outputs will be made available online during the competition. A program-run is started by a command that consists of the system’s executable name, the program file, and an instance file. Examples:

swipl -g "main,halt."

clingo prog1.asp 

picat prog1.pi 

minizinc prog1.mzn instance1.dzn 

eclipse -e main -f -f

All outputs must be sent to the console in the format specified by the problem description. Programs are run on test instances during the competition. If a program fails to give a correct answer or fails to solve an instance in 60 seconds, the team may be notified by email and can submit another program.

There will be prizes for the winners of both the on-site and online tracks. There are separate rankings for the on-site and online tracks. The teams are ranked by the number of correctly solved problems. If necessary, the submission times and the run times of the solutions are used to break ties.


Q1: Do I have to register for the competition in advance?

No, you do not have to register in advance. Nevertheless, you may want to test your Easychair account by submitting an empty solution in advance, so that you can save some time when submitting real solutions.

Q2: Can I use a Prolog system that does not support constraints?

Yes, most of the instances are easy to solve, even with simple backtracking.


  • Paul Fodor: pfodor at
  • Antonius Weinzierl: antonius.weinzierl at
  • Aakash Kattelu: aakash.kattelu at
  • Tyler Estro: tyler.estro at
  • Akshit Poddar: akshit.poddar at
  • James A. Morris: james.a.morris at
  • Xiao Zhang: xiao.zhang at
  • Keshav Kalanadhabhatta: keshav.kalanadhabhatta dot