smodels 2.6: January 27, 1999
- The introduction of the complete randomized search also introduced a
bug. It is now fixed.
- The logic program is simplified some more before the search begins.
smodels 2.5: January 14, 1999
- Improved pruning slightly when optimizing (maximize/minimize)
- Introduced complete randomized search (-randomize). This is still
slow but will become faster.
smodels 2.4: November 12, 1998
- Simplified backchaining in the weight rule.
smodels 2.3: November 11, 1998
- Changed the format of the constraint rule from
h :- n1 { a1,...,an } n2 { not b1,...,not bm } to
h :- n { a1,...,an, not b1,...,not bm }.
- Simplified atomrule.{h,cc} a bit.
smodels 2.2: November 9, 1998
- Simplified the weight rule. Only positive weights are allowed, and
the weight is only bounded from below. The old type of weight rule
can easily be expressed using the new type, see pparse 1.13.
smodels 2.1: November 5, 1998
- Fixed bug in improve.cc that could corrupt the program when using
weight rules.
- Introduced a naive version of iterative deepening (option -iterate).
Solves some hard problems.