Index of /anton/lvas/stack-abgaben/12w/PostscriptSatSolver

[ICO]NameLast modifiedSizeDescription

[PARENTDIR]Parent Directory  -  
[   ]PSSS2013-01-24 12:21 3.7K 
[   ]input4.sat2013-01-11 15:44 88  
[   ]input_invalid2.sat2013-01-11 15:40 70  
[   ]psss_input_reader2013-01-11 15:36 4.0K 
[   ]PostscriptSatSolver.pdf2013-01-11 15:33 67K 
[   ]input3.sat2013-01-11 15:27 72  
[   ]input2.sat2013-01-11 15:23 67  
[   ]psss_output_writer2013-01-11 15:17 2.1K 
[   ]psss_generator2013-01-10 18:13 1.5K 
[   ]input_invalid.sat2013-01-10 17:17 72  
[   ]input.sat2012-12-07 16:20 67  

This is a simple SAT solver written in Postscript.
It uses a brute force approach to solve small instances of SAT problems.

The program:
 - PSSS 		=> main program file, program start
 - psss_input_reader 	=> reads and validates the input file
 - psss_generator	=> generates the variable assignments
 - psss_output_writer	=> writes to an output file 

Start the programm by typing the following command into your shell:
gs PSSS

Once the program has initialized itself it will ask you for an input file.
Enter the following:
(input.sat) doit

You can specify another filename instead of input.sat as you wish.
The input files have to be consistent to the "minisat" format.

The program then tries to find a valid truth assignment for the given input.
It exits if one valid assignment is found or if all possible assignments have failed.

The output will be written to "output.sat".

PS: There are some configuration values in the main file "PSSS". For example, you 
can change them to make the program continue searching for all valid assignments 
and output them even if one has already beeen found.

Greetings,
Belk Stefan & Hönisch Philipp