Solving QMLTP Problems by Translation to Higher-order Logic

12/19/2022
by   Alexander Steen, et al.
0

This paper describes an evaluation of Automated Theorem Proving (ATP) systems on problems taken from the QMLTP library of first-order modal logic problems. Principally, the problems are translated to higher-order logic in the TPTP languages using an embedding approach, and solved using higher-order logic ATP systems. Additionally, the results from native modal logic ATP systems are considered, and compared with those from the embedding approach. The conclusions are that (i) The embedding process is reliable and successful. (ii) The choice of backend ATP system can significantly impact the performance of the embedding approach. (iii) Native modal logic ATP systems outperform the embedding approach. (iv) The embedding approach can cope with a wider range modal logics than the native modal systems considered.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2011

Embedding and Automating Conditional Logics in Classical Higher-Order Logic

A sound and complete embedding of conditional logics into classical high...
research
08/31/2016

Knowledge Representation Analysis of Graph Mining

Many problems, especially those with a composite structure, can naturall...
research
07/31/2015

Systematic Verification of the Modal Logic Cube in Isabelle/HOL

We present an automated verification of the well-known modal logic cube ...
research
03/06/2019

GRUNGE: A Grand Unified ATP Challenge

This paper describes a large set of related theorem proving problems obt...
research
12/20/2019

Analysis of Graph Transformation Systems: Native vs Translation-based Techniques

The paper summarises the contributions in a session at GCM 2019 presenti...
research
11/02/2021

Automating Public Announcement Logic with Relativized Common Knowledge as a Fragment of HOL in LogiKEy

A shallow semantical embedding for public announcement logic with relati...
research
04/21/2020

The Imandra Automated Reasoning System (system description)

We describe Imandra, a modern computational logic theorem prover designe...

Please sign up or login with your details

Forgot password? Click here to reset