Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver.
Saved in:
| Title: | Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver. |
|---|---|
| Authors: | Naumowicz, Adam1 adamn@mizar.org |
| Source: | Journal of Automated Reasoning. Oct2015, Vol. 55 Issue 3, p285-294. 10p. |
| Subjects: | Automatic theorem proving, Checker problems, Boolean functions, Computers in mathematics, Intersection numbers |
| Abstract: | 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 Boolean operations or set inclusion). The external tool is interfaced within the implementation of Mizar's requirements directives. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
