The following pages link to (Q2751380):
Displaying 18 items.
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- SAD as a mathematical assistant -- how should we go from here to there? (Q865654) (← links)
- A sound framework for \(\delta\)-rule variants in free-variable semantic tableaux (Q877883) (← links)
- Connection tableaux with lazy paramodulation (Q928656) (← links)
- Machine learning guidance for connection tableaux (Q2031418) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- \textsf{lazyCoP}: lazy paramodulation meets neurally guided search (Q2142075) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Craig interpolation with clausal first-order tableaux (Q2666953) (← links)
- Encoding First Order Proofs in SMT (Q2864408) (← links)
- A Non-clausal Connection Calculus (Q3010371) (← links)
- Specifying and Verifying Organizational Security Properties in First-Order Logic (Q3058451) (← links)
- Efficient Low-Level Connection Tableaux (Q3455764) (← links)
- leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) (Q3541708) (← links)
- From Schütte’s Formal Systems to Modern Automated Deduction (Q5013905) (← links)
- Prolog Technology Reinforcement Learning Prover (Q5049033) (← links)
