MleanCoP

swMATH21522MaRDI QIDQ33329FDOQ33329

Author name not available (Why is that?)

Described by source

• MleanCoP: A Connection Prover for First-Order Modal Logic

Cited In (14)

• Local reductions for the modal cube
• A Meta-level Annotation Language for Legal Texts
• Towards an Executable Methodology for the Formalization of Legal Texts
• nanoCoP: A Non-clausal Connection Prover
• Extensional higher-order paramodulation in Leo-III
• Eliminating models during model elimination
• The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics
• Machine learning guidance for connection tableaux
• Theorem Provers For Every Normal Modal Logic
• 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
• Local is best: efficient reductions to modal logic \textsf{K}
• Higher-Order Modal Logics: Automation and Applications
• Prolog Technology Reinforcement Learning Prover
• The higher-order prover Leo-III

This page was built for software: MleanCoP