Search Results for author:
Found 5 papers, 3 papers with code
Solving QMLTP Problems by Translation to Higher-order Logic
The findings are that the embedding process is reliable and successful, the choice of backend ATP system can significantly impact the performance of the embedding approach, native modal logic ATP systems outperform the embedding approach, and the embedding approach can cope with a wider range modal logics than the native modal systems considered.
Who Finds the Short Proof? An Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers
This paper reports on an exploration of Boolos' Curious Inference, using higher-order automated theorem provers (ATPs).
Automated Reasoning in Non-classical Logics in the TPTP World
Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy.
GRUNGE: A Grand Unified ATP Challenge
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
Modeling in OWL 2 without Restrictions
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.
