English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper describes an evaluation of Automated Theorem Proving (ATP) systemson problems taken from the QMLTP library of first-order modal logic problems.Principally, the problems are translated to higher-order logic in the TPTPlanguage using an embedding approach, and solved using higher-order logic ATPsystems. Additionally, the results from native modal logic ATP systems areconsidered, and compared with those from the embedding approach. The findingsare that the embedding process is reliable and successful, the choice ofbackend ATP system can significantly impact the performance of the embeddingapproach, native modal logic ATP systems outperform the embedding approach, andthe embedding approach can cope with a wider range modal logics than the nativemodal systems considered.

Solving QMLTP Problems by Translation to Higher-order Logic