MleanCoP: A Connection Prover for First-Order Modal Logic
From MaRDI portal
Publication:3192198
DOI10.1007/978-3-319-08587-6_20zbMath1423.68423OpenAlexW102946451MaRDI QIDQ3192198
Publication date: 26 September 2014
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08587-6_20
Related Items
Prolog Technology Reinforcement Learning Prover, The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics, Eliminating models during model elimination, Extensional higher-order paramodulation in Leo-III, Solving modal logic problems by translation to higher-order logic, Higher-Order Modal Logics: Automation and Applications, Machine learning guidance for connection tableaux, nanoCoP: A Non-clausal Connection Prover, Efficient local reductions to basic modal logic, MleanCoP, From Schütte’s Formal Systems to Modern Automated Deduction, Local is best: efficient reductions to modal logic \textsf{K}, Local reductions for the modal cube
Uses Software
