The directory contains the test cases discussed in the paper 

Logic Programs with Stable Model Semantics as a Constraint
Programming Paradigm

by Ilkka Niemela 

Helsinki University of Technology             email: Ilkka.Niemela@hut.fi 
Dept. of Computer Science and Engineering     phone: +358-9-451 3290       
Laboratory for Theoretical Computer Science   fax:   +358-9-451 3369
P.O.Box 5400, FIN-02015 HUT, Finland          URL: http://www.tcs.hut.fi/~ini

The following problems are considered. 

- CSP problems:

  pigeon.lp 
  queens.lp 
  schur.lp

- Combinatorial graph problems:

  K-coloring: color.lp 
  Hamiltonian circuits: hc.lp

  where the graphs used in the tests are in the subdirectory graphs

- Planning:

  Blocks world planning: 

  bw.lp + (bw-large.c, bw-large.d, bw-large.e)


See each *.lp file for a typical command line parameter setting 

For running the tests you need programs smodels and lparse
which can be downloaded from 

           http://www.tcs.hut.fi/pub/smodels/

