Abstract The Thousands of Problems for Theorem Provers (TPTP) World is a well-
established infrastructure that supports research, development and deployment of …

The TPTP World is a well established infrastructure supporting research, development, and
deployment of Automated Theorem Proving systems. Recently, the TPTP World has been …

Many statically typed programming languages provide an abstract data type construct, such
as the module in Modula-2. However, in most of these languages, implementations of …

A syntax transformation is presented that eliminates the modal logic operators from modal
logic formulae by shifting the modal context information to the term level. The formulae in the …

Many sorted logics can increase deductive efficiency by eliminating useless branches of the
search space, but usually this results in reduced expressiveness. The many sorted logic …

Publisher Summary This chapter discusses order-sorted equational computation. Many-
sorted equational logic is the basis for algebraic specifications, rewriting techniques …

Wolves, foxes, birds, caterpillars, and snails are animals, and there are some of each of
them. Also there are some grains, and grains are plants. Every ammal either likes to eat all …

Many-sorted unification is considered; that is, unification in the many-sorted free algebras of
terms, where variables, as well as the domains and ranges of functions, are restricted to …

We present a type inference algorithm for a Haskell-like language based on order-sorted
unification. The language features polymorphism, overloading, type classes and multiple …

This paper describes a new format for representing Tarskian-style interpretations for
formulae in typed first-order logic, using the TPTP TF0 language. It further describes a …