Improving legibility of formal proofs based on the close reference principle is NP-hard (Q286805)

From MaRDI portal
Revision as of 00:22, 28 December 2024 by Import241228121202 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Improving legibility of formal proofs based on the close reference principle is NP-hard
scientific article

    Statements

    title
    Improving legibility of formal proofs based on the close reference principle is NP-hard (English)
    0 references
    author
    Karol Pąk
    0 references
    publication date
    26 May 2016
    0 references
    zbMATH Keywords
    natural deduction
    0 references
    legibility
    0 references
    NP-completeness
    0 references
    describes a project that uses
    Coq
    0 references
    Mizar
    0 references
    HOL
    0 references
    MMode
    0 references
    Isabelle/Isar
    0 references
    Isar
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68T15
    0 references
    03B35
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6585261
    0 references
    Wikidata QID
    Q59407604
    0 references
    OpenAlex ID
    W1268136390
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q286805&oldid=39368848"
    Powered by MediaWiki