This paper describes the TPTP problem library and associated infrastructure, from its use of
Clause Normal Form (CNF), via the First-Order Form (FOF) and Typed First-order Form …

After an introductory section, this article will focus on four questions: How should the Kyoto
School be defined? What is meant by its central philosophical concept of “absolute …

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 …

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 …

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 …

This paper discusses the discovery of the inconsistency in Gödel's ontological argument as
a success story for artificial intelligence. Despite the popularity of the argument since the …

Abstract Reasoning about epistemic possibilities–those based on knowledge–is
fundamental in daily life. It is formalized in modal logics, of which there are infinitely many …

This paper describes the TPTP problem library and associated infrastructure, from its use of
Clause Normal Form (CNF), via the First-Order Form (FOF) and Typed First-order Form …

Computational philosophy is the use of mechanized computational techniques to instantiate,
extend, and amplify philosophical research. Computational philosophy is not philosophy of …

Church's type theory, aka simple type theory, is a formal logical language which includes
classical first-order and propositional logic, but is more expressive in a practical sense. It is …