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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(10 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mizar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MMode / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/Isar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isar / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59407604 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-015-9337-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1268136390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Licensing the Mizar Mathematical Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Declarative Language for the Coq Proof Assistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving legibility of natural deduction proofs is not trivial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Knowledge Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisions as an Essential Tool to Maintain Mathematical Repositories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Discovery of Properties of Rough Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Rough Set Theory Merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of lemma extraction in natural deduction proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tentative Experiments with Ellipsis in Mizar / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rewriting rules in Mizar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Knowledge Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Brief Overview of Mizar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interfacing external CA systems for Gröbner bases computation in M<scp>izar</scp>proof checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Knowledge Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790672 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 01:01, 12 July 2024

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

    Improving legibility of formal proofs based on the close reference principle is NP-hard (English)
    0 references
    0 references
    26 May 2016
    0 references
    natural deduction
    0 references
    legibility
    0 references
    NP-completeness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers