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
• 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
• Higher-order modal logics: automation and applications
• 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}
• Prolog Technology Reinforcement Learning Prover
• The higher-order prover Leo-III
• nanoCoP: a non-clausal connection prover
• Theorem provers for every normal modal logic

This page was built for software: MleanCoP