Pages that link to "Item:Q3568228"
From MaRDI portal
The following pages link to Restricting backtracking in connection calculi (Q3568228):
Displayed 14 items.
- Machine learning guidance for connection tableaux (Q2031418) (← 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)
- Craig interpolation with clausal first-order tableaux (Q2666953) (← links)
- A Connection Calculus for the Description Logic $$ {\mathcal{ALC}} $$ (Q2814524) (← links)
- nanoCoP: A Non-clausal Connection Prover (Q2817929) (← links)
- A Non-clausal Connection Calculus (Q3010371) (← links)
- MaLeCoP Machine Learning Connection Prover (Q3010374) (← 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)
- Cardinality Restrictions Within Description Logic Connection Calculi (Q6104758) (← links)