The following pages link to (Q4264737):
Displaying 15 items.
- Solving the \$100 modal logic challenge (Q1006738) (← links)
- Uniform strategies: The CADE-11 theorem proving contest (Q1319384) (← links)
- Searching for circles of pure proofs (Q1904397) (← links)
- Learning from Łukasiewicz and Meredith: investigations into proof structures (Q2055843) (← links)
- Towards finding longer proofs (Q2142073) (← links)
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
- MGTP: A model generation theorem prover — Its advanced features and applications — (Q4610311) (← links)
- Experiments in the heuristic use of past proof experience (Q4647545) (← links)
- Building Theorem Provers (Q5191110) (← links)
- The TPTP problem library (Q5210777) (← links)
- Automatic verification of cryptographic protocols with SETHEO (Q5234693) (← links)
- CODE: A powerful prover for problems of condensed detachment (Q5234708) (← links)
- Conditional term rewriting and first-order theorem proving (Q5881190) (← links)
- Lemmas: generation, selection, application (Q6541149) (← links)
- Investigations into proof structures (Q6653096) (← links)
