View in EDS

Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver.

Saved in:
Bibliographic Details
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 109992880
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Naumowicz%2C+Adam%22">Naumowicz, Adam</searchLink><relatesTo>1</relatesTo><i> adamn@mizar.org</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Automated+Reasoning%22">Journal of Automated Reasoning</searchLink>. Oct2015, Vol. 55 Issue 3, p285-294. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Automatic+theorem+proving%22">Automatic theorem proving</searchLink><br /><searchLink fieldCode="DE" term="%22Checker+problems%22">Checker problems</searchLink><br /><searchLink fieldCode="DE" term="%22Boolean+functions%22">Boolean functions</searchLink><br /><searchLink fieldCode="DE" term="%22Computers+in+mathematics%22">Computers in mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Intersection+numbers%22">Intersection numbers</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=109992880
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10817-015-9332-6
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 285
    Subjects:
      – SubjectFull: Automatic theorem proving
        Type: general
      – SubjectFull: Checker problems
        Type: general
      – SubjectFull: Boolean functions
        Type: general
      – SubjectFull: Computers in mathematics
        Type: general
      – SubjectFull: Intersection numbers
        Type: general
    Titles:
      – TitleFull: Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Naumowicz, Adam
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2015
              Type: published
              Y: 2015
          Identifiers:
            – Type: issn-print
              Value: 01687433
          Numbering:
            – Type: volume
              Value: 55
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Journal of Automated Reasoning
              Type: main
ResultId 1