Modeling in OWL 2 without Restrictions

no code implementations • 12 Dec 2012 • Michael Schneider, Sebastian Rudolph, Geoff Sutcliffe

We then report on the results of evaluating several state-of-the-art OWL 2 DL reasoners on problems that use combinations of features in a way that the global restrictions are violated.

Automated Theorem Proving

GRUNGE: A Grand Unified ATP Challenge

1 code implementation • 6 Mar 2019 • Chad E. Brown, Thibault Gauthier, Cezary Kaliszyk, Geoff Sutcliffe, Josef Urban

This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms.

Logic in Computer Science

Automated Reasoning in Non-classical Logics in the TPTP World

no code implementations • 20 Feb 2022 • Alexander Steen, David Fuenmayor, Tobias Gleißner, Geoff Sutcliffe, Christoph Benzmüller

Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy.

Automated Theorem Proving Philosophy

Who Finds the Short Proof? An Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers

1 code implementation • 14 Aug 2022 • Christoph Benzmüller, David Fuenmayor, Alexander Steen, Geoff Sutcliffe

This paper reports on an exploration of Boolos' Curious Inference, using higher-order automated theorem provers (ATPs).

Solving Quantified Modal Logic Problems by Translation to Classical Logics

1 code implementation • 19 Dec 2022 • Alexander Steen, Geoff Sutcliffe, Christoph Benzmüller

This article describes an evaluation of Automated Theorem Proving (ATP) systems on problems taken from the QMLTP library of first-order modal logic problems.

Automated Theorem Proving Translation