The copyright for the scripts is held by Emilia Oikarinen. You may freely use 
and modify these scripts for academic and research purposes but not 
redistribute them.

USING OF THE SCRIPTS:

- queens_test <number_of_queens_start> <number_of_queens_end> <trials>

  Tests the equivalence of two formulations of n-queens problem
  (programs/queens.lp and programs/queens_choice.lp) using LPEQ and NAIVE 
  approachs.

- general_test <type> <variables_start> <variables_end> <trials>
 
  Tests the equivalence of two random logic programs of type <type>
  using LPEQ and NAIVE approaches. The second program is obtained from
  the first by dropping one random rule.

  Supported problem types:
  * rsat_const_ratio
    Programs are random 3-SAT instances, clauses/variables ratio is
    kept at 4 and number of variables is varied. 

  * rsat_varying_ratio
    Programs are random 3-SAT instances, number of variables is kept
    at 40 and number of clauses (and thus clauses/variables ratio) is
    varied. 

  * color
    Problem is 4-COLORING of a random graph, number of vertices is
    varied. Needs file programs/color.lp.

  * hc
    Problem is finding HAMILTONIAN CYCLES of a random graph, number of
    vertices is varied. Needs file programs/hc.lp.

- queens_times.sh <variables> <trials>
  running_times.sh <type> <variables> <trials>
  
  Subscripts called by queens_test and general_test.

- naive.sh <program1.sm> <program2.sm>

  Implementation of the naive approach as a shell script.