CILC09

First Computational Logic Programming Competition

The first computational logic programming competition will take place at CILC09. It is inspired by the Prolog Programming Contest, but it has a wider scope, and different rules.

Aims and Scope

The aim of the competition is to let people address problems with any computational logic system. Bring your own laptop and show the world that your own computational logic language lets you write programs faster than other competing languages. Of course, you are welcome to use also an off-the-shelf system, and prove to be a faster programmer.

Examples of welcome systems are:

• Prolog (any you like)
• Answer Set Programming
• Constraint Logic Programming
• Abductive Logic Programming

Of course, your system should be declarative and based on logics. If your preferred system does not fit in the previous list, please ask in advance to Marco Gavanelli. Also, if you use a commercial system, please ensure that the organizers have access to it, again asking Marco Gavanelli.

We encourage you to use different tools for different problems. We believe a computational logic programmer should select the right tool for the right problem. If you use plain Prolog for problem 1, ASP for problem 2, ALP for problem 3, that's perfectly fine.

Rules

You have 1 hour of time; you can work in teams of up to two persons, you must bring your own laptop computer (one computer per team).

This year the competition will focus on Constraint Satisfaction Problems and Constraint Optimization Problems.

Some sample problems (in Italian)

• Problem 1
• Problem 2
• Problem 3

The winner is the person that solves more problems in one hour, i.e., the programmer that, within one hour, is able to give the numerical result of more CSPs (i.e., the assignment). The allotted time includes the time to write the program and to run it.

In case of equal number of solved problems, the most efficient solution is better (we evaluate the execution time of your software).