The following pages link to SRASS (Q33178):
Displaying 11 items.
- Learning-assisted theorem proving with millions of lemmas (Q485842) (← links)
- Automated verification of refinement laws (Q1037397) (← links)
- An abstraction-refinement framework for reasoning with large theories (Q1799131) (← links)
- Names are not just sound and smoke: word embeddings for axiom selection (Q2305419) (← links)
- Detecting inconsistencies in large first-order knowledge bases (Q2405258) (← links)
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
- Lemmatization for Stronger Reasoning in Large Theories (Q2964472) (← links)
- History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
- System Description: E.T. 0.1 (Q3454109) (← links)
- Theorem Proving in Large Formal Mathematics as an Emerging AI Field (Q4913871) (← links)
- Sine Qua Non for Large Theory Reasoning (Q5200032) (← links)
