• Publications
  • Influence
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)
tl;dr
LEO-II is a standalone, resolution-based higher-order theorem prover designed for effective cooperation with specialist provers for natural fragments of higher- order logic, and its problem representation language is the new TPTP THF language. Expand
  • 99
  • 8
Quantified Multimodal Logics in Simple Type Theory
tl;dr
We present an embedding of quantified multimodal logics into simple type theory and prove its soundness and completeness. Expand
  • 99
  • 5
Automating Gödel's Ontological Proof of God's Existence with Higher-order Automated Theorem Provers
tl;dr
Kurt Godel's ontological argument for God's existence has been formalized and automated on a computer with higher-order automated theorem provers. Expand
  • 62
  • 4
The Higher-Order Prover Leo-III
tl;dr
The automated theorem prover Leo-III is based on extensional higher-order paramodulation and accepts every common TPTP dialect (FOF, TFF, THF), including their recent extensions to rank-1 polymorphism. Expand
  • 38
  • 4
Higher-order semantics and extensionality
tl;dr
We re-examine the semantics of classical higher-order logic with the purpose of clarifying the role of extensionality with respect to various combinations of Boolean extensionality and three forms of functional extensionality. Expand
  • 113
  • 3
Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure
tl;dr
The Thousands of Problems for theorem Provers (TPTP) problem library is the basis of a well known and well established infrastructure that supports research, development, and deployment of Automated Theorem Proving (ATP) systems. Expand
  • 109
  • 3
System Description: LEO - A Higher-Order Theorem Prover
tl;dr
We propose a higher-order theorem prover based upon Church’s simply typed λ-calculus, so that the comprehension axioms are implicitly handled by αβη-equality. Expand
  • 87
  • 3
The Higher-Order Prover Leo-II
tl;dr
Leo-II is an automated theorem prover for classical higher-order logic, and it has been applied in a wide array of problems. Expand
  • 64
  • 3
THF0 - The Core of the TPTP Language for Higher-Order Logic
tl;dr
This paper introduces the core of the TPTP language for higher-order logic --- THF0, based on Church's simple type theory. Expand
  • 56
  • 3
Extensional Higher-Order Paramodulation and RUE-Resolution
tl;dr
This paper presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus EP adapting traditional first-order paramodulation [RW69] to classical type theory, and a calculus ERUE adapting FO RUE-Resolution [Dig79]. Expand
  • 42
  • 3