The following pages link to MleanCoP (Q33329):
Displaying 14 items.
- The higher-order prover Leo-III (Q1799072) (← links)
- Machine learning guidance for connection tableaux (Q2031418) (← links)
- Local is best: efficient reductions to modal logic \textsf{K} (Q2102930) (← links)
- Local reductions for the modal cube (Q2104538) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- Automated reasoning. 7th international joint conference, IJCAR 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 19--22, 2014. Proceedings (Q2250555) (← links)
- Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
- nanoCoP: A Non-clausal Connection Prover (Q2817929) (← links)
- Higher-Order Modal Logics: Automation and Applications (Q2970308) (← links)
- Theorem Provers For Every Normal Modal Logic (Q4645724) (← links)
- Prolog Technology Reinforcement Learning Prover (Q5049033) (← links)
- A Meta-level Annotation Language for Legal Texts (Q5098747) (← links)
- Towards an Executable Methodology for the Formalization of Legal Texts (Q5098748) (← links)