The following pages link to SPASS+T (Q16784):
Displaying 20 items.
- A heuristic prover for real inequalities (Q287379) (← links)
- An instantiation scheme for satisfiability modulo theories (Q438578) (← links)
- MetiTarski: An automatic theorem prover for real-valued special functions (Q972422) (← links)
- Solving quantified verification conditions using satisfiability modulo theories (Q1037401) (← links)
- Layered clause selection for theory reasoning (short paper) (Q2096461) (← links)
- On automation in the verification of software barriers: experience report (Q2351145) (← links)
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\) (Q2351415) (← links)
- Proving Infinite Satisfiability (Q2870117) (← links)
- A Heuristic Prover for Real Inequalities (Q2879243) (← links)
- The TPTP Typed First-Order Form with Arithmetic (Q2891471) (← links)
- Beagle – A Hierarchic Superposition Theorem Prover (Q3454107) (← links)
- Extensional Crisis and Proving Identity (Q3457789) (← links)
- Automated Reasoning for Hybrid Systems — Two Case Studies — (Q3498414) (← links)
- Extending a Resolution Prover for Inequalities on Elementary Functions (Q3498456) (← links)
- An Extension of the Knuth-Bendix Ordering with LPO-Like Properties (Q3498479) (← links)
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (Q3608775) (← links)
- Theorem Proving in Large Formal Mathematics as an Emerging AI Field (Q4913871) (← links)
- TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism (Q4928456) (← links)
- Using First-Order Theorem Provers in the Jahob Data Structure Verification System (Q5452598) (← links)
- MetiTarski: An Automatic Prover for the Elementary Functions (Q5505501) (← links)
