Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › Solving quantified modal logic problems by translation to classical logics

Publication

Solving quantified modal logic problems by translation to classical logics

Steen, Alexander; Sutcliffe, Geoff; Benzmüller, Christoph (2026): Solving quantified modal logic problems by translation to classical logics, in: Bamberg: Otto-Friedrich-Universität, S. 1–27.

Details

Faculty/Chair
Faculty/Professorship
Author
Steen, Alexander
Sutcliffe, Geoff
Publisher Information
Otto-Friedrich-Universität : Bamberg
Year of publication
2026
Source/Other editions
Journal of logic and computation, Eynsham, Oxford: Oxford Univ. Press, 2025, Jg. 35, Nr. 4, exaf006, S. 1–23, ISSN: 1465-363X, 0955-792X
Year of first publication
2025
Language
English
Licence
URN
Abstract

This article 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 both typed first-order and higher-order logic in the TPTP language using an embedding approach, and solved using first-order resp. higher-order logic ATP systems and model finders. Additionally, the results from native modal logic ATP systems are considered, and compared with the results from the embedding approach. The findings are that the embedding process is reliable and successful when state-of-the-art ATP systems are used as backend reasoners, The first-order and higher-order embeddings perform similarly, native modal logic ATP systems have comparable performance to classical systems using the embedding for proving theorems, native modal logic ATP systems are outperformed by the embedding approach for disproving conjectures, and the embedding approach can cope with a wider range of modal logics than the native modal systems considered.

Keywords
Non-classical logics
Quantified modal logics
Higher-order logic
First-order logic
Automated theorem proving
Peer Reviewed
yes
International Distribution
yes
Open Access Journal
no
Type
Article
URI
Activation date
2026-08-06

Permalink: https://fis.uni-bamberg.de/handle/uniba/116610 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-16

Restricted read-only access: login, editing and submission are temporarily disabled.