A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver
2015
Journal of automated reasoning
In this paper we present the results of an experiment with employing an external SAT solver to strengthen the notion of obviousness of the MIZAR proof checker. The presented extension of the MIZAR system is based on a version of MiniSAT, called Logic2CNF. The SAT-enhanced MIZAR checker is programmed to automatically spawn a new Logic2CNF process whenever it needs to justify any goal that can be solved by reducing it into a corresponding propositional satisfiability problem (equalities based on
doi:10.1007/s10817-015-9332-6
fatcat:oq5uq4kls5ellhi6ryoh6una3q