Automated reasoning in higher-order logic using the TPTP THF infrastructure

G Sutcliffe, C Benzmüller - Journal of Formalized Reasoning, 2010 - jfr.unibo.it
Abstract The Thousands of Problems for Theorem Provers (TPTP) problem library is the
basis of a well known and well established infrastructure that supports research …

Mechanized Metatheory for the Masses: The PoplMark Challenge

BE Aydemir, A Bohannon, M Fairbairn… - Theorem Proving in …, 2005 - Springer
How close are we to a world where every paper on programming languages is
accompanied by an electronic appendix with machine-checked proofs? We propose an …

[HTML][HTML] Designing normative theories for ethical and legal reasoning: LogiKEy framework, methodology, and tool support

C Benzmüller, X Parent, L van der Torre - Artificial intelligence, 2020 - Elsevier
A framework and methodology—termed LogiKEy—for the design and engineering of ethical
reasoners, normative theories and deontic logics is presented. The overall motivation is the …

[KNJIGA][B] A philosophical introduction to higher-order logics

A Bacon - 2023 - taylorfrancis.com
This is the first comprehensive textbook on higher-order logic that is written specifically to
introduce the subject matter to graduate students in philosophy. The book covers both the …

The logic languages of the TPTP world

G Sutcliffe - Logic Journal of the IGPL, 2023 - academic.oup.com
Abstract The Thousands of Problems for Theorem Provers (TPTP) World is a well-
established infrastructure that supports research, development and deployment of …

[HTML][HTML] Universal (meta-) logical reasoning: Recent successes

C Benzmüller - Science of Computer Programming, 2019 - Elsevier
Classical higher-order logic, when utilized as a meta-logic in which various other (classical
and non-classical) logics can be shallowly embedded, is suitable as a foundation for the …

The Higher-Order Prover Leo-II

C Benzmüller, N Sultana, LC Paulson… - Journal of Automated …, 2015 - Springer
Leo-II is an automated theorem prover for classical higher-order logic. The prover has
pioneered cooperative higher-order–first-order proof automation, it has influenced the …

Quantified multimodal logics in simple type theory

C Benzmüller, LC Paulson - Logica Universalis, 2013 - Springer
We present an embedding of quantified multimodal logics into simple type theory and prove
its soundness and completeness. A correspondence between QKπ models for quantified …

Classicism

A Bacon, C Dorr - 2024 - philpapers.org
This three-part chapter explores a higher-order logic we call 'Classicism', which extends a
minimal classical higher-order logic with further axioms which guarantee that provable …

Extensional higher-order paramodulation in Leo-III

A Steen, C Benzmüller - Journal of Automated Reasoning, 2021 - Springer
Leo-III is an automated theorem prover for extensional type theory with Henkin semantics
and choice. Reasoning with primitive equality is enabled by adapting paramodulation-based …