Version 2.3.1 (November 1995)

• We have added support for hierarchical theories.
• Ordering declarations and directives for saturation may be kept separately from the definition of theories, cf. command in.
• We have integrated a Davis-Putnam-like satisfiability checker contributed by Peter Barth (SICStus 3.0 only). This is useful for medium-sized to large near-propositional problems such as in this example.

Imprint | Data Protection