Competitions for best SAT solvers (and planners etc. )

[Subbarao Kambhampati <rao@parichaalak.eas.asu.edu>]

AI these days has many competitions to foster algorithm development.

The competition for best SAT solvers is held as part of the SAT
conference. The results from this years (2003) SAT Competition can be
found at:

http://www.satlive.org/SATCompetition/2003/results.html

(the current best seems to be Forklift--a solver based on
Berkmin--which was inspired by CHAFF).

The competition for best planners is held at the ICAPS (the planning
and scheduling conference. The results from the most recent
competition (2002) canbe found at:

http://www.dur.ac.uk/d.p.long/IPC/main.html

(the current best, for classical planning problems, is a local
(hill-climbing) search planner called LPG). 

Rao