Search Results for author:
Found 12 papers, 5 papers with code
An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic
An approach for encoding abstract dialectical frameworks and their semantics into classical higher-order logic is presented.
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.
Bridging between LegalRuleML and TPTP for Automated Normative Reasoning (extended version)
LegalRuleML is a comprehensive XML-based representation framework for modeling and exchanging normative rules.
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).
An Extensible Logic Embedding Tool for Lightweight Non-Classical Reasoning
The logic embedding tool provides a procedural encoding for non-classical reasoning problems into classical higher-order logic.
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.
A Formalisation of Abstract Argumentation in Higher-Order Logic
We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic.
On Reductions of Hintikka Sets for Higher-Order Logic
Steen's (2018) Hintikka set properties for Church's type theory based on primitive equality are reduced to the Hintikka set properties of Brown (2007).
The NAI Suite -- Drafting and Reasoning over Legal Texts
A prototype for automated reasoning over legal texts, called NAI, is presented.
Extensional Higher-Order Paramodulation in Leo-III
Leo-III is an automated theorem prover for extensional type theory with Henkin semantics and choice.
The Higher-Order Prover Leo-III (Extended Version)
The automated theorem prover Leo-III for classical higher-order logic with Henkin semantics and choice is presented.
LeoPARD --- A Generic Platform for the Implementation of Higher-Order Reasoners
LeoPARD supports the implementation of knowledge representation and reasoning tools for higher-order logic(s).
