Minlog: A minimal logic theorem prover. Minlog is a theorem prover for propositional minimal logic and Heyting’s intuitionist logic. It implements a decision procedure based on a cut-free sequent calculus formulation of these systems. While the method it uses is rather unsophisticated, on small problems Minlog is fast. It achieves speed by being carefully coded (in C) and by eliminating many obvious redundancies in proof searches. It is thus useful as a point of comparison, since it represents what can be done by brute force rather than intelligence. The decision problem for the logics concerned is PSPACE hard so intelligence should easily triumph over mere speed. Minlog provides a suitable baseline for evaluating implemented systems.
Keywords for this software
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Slaney, John: \textscMinlog: a minimal logic theorem prover (1997)
- Demri, Stéphane: Uniform and non uniform strategies for tableaux calculi for modal logics (1995)