The following pages link to (Q3490999):
Displaying 16 items.
- Improving legibility of formal proofs based on the close reference principle is NP-hard (Q286805) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Structuring resolution proofs by introducing new lemmata or how to improve the readability of ATP-generated proofs (Q1369079) (← links)
- Presenting inequations in mathematical proofs (Q1818758) (← links)
- A uniform procedure for converting matrix proofs into sequent-style systems (Q1854382) (← links)
- Methods of lemma extraction in natural deduction proofs (Q1945902) (← links)
- Finding good proofs for description logic entailments using recursive quality measures (Q2055864) (← links)
- Procedural representation of CIC proof terms (Q2655331) (← links)
- Granularity analysis for tutoring mathematical proofs (Q2883194) (← links)
- Formalizing a Hierarchical Structure of Practical Mathematical Reasoning (Q4272504) (← links)
- (Q4283227) (← links)
- Presenting machine-found proofs (Q4647515) (← links)
- Converting non-classical matrix proofs into sequent-style systems (Q4647538) (← links)
- Reconstructing proofs at the assertion level (Q5210809) (← links)
- Presenting intuitive deductions via symmetric simplification (Q6488543) (← links)
- Toward mechanical methods for streamlining proofs (Q6488544) (← links)