Smodels (logic programs with stable model semantics) by Patrik Simons
and Ilkka Niemelä
Home Assignments
There is a compulsory home assignment for each student.
The assigments are now available. If you do not yet have one, please
contact the lecturer.
For further details, see the
instructions (in Finnish).
Each student gives a short presentation (15 min) on the home
assignment on Dec 2, 1997.
For grading of the returned assignments, see summary of the
results.
Other Interesting Stuff
-
Robbins Algebras Are Boolean
- Information on a proof of a famous mathematical conjecture found by
an automated theorem prover.
Latest update: Oct 7, 1997 by Ilkka.Niemela@hut.fi