A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

We describe the superposition‐based theorem prover E. E is a sound and complete prover
for clausal first order logic with equality. Important properties of the prover include strong …

Publisher Summary Mathematical logicians had developed the art of formalizing declarative
knowledge long before the advent of the computer age. But they were interested primarily in …

In this paper we present a proposed information infrastructure framework for supporting
management of electronic virtual organizations. We identify the life cycle phases (and their …

This paper provides a detailed description of the CNF part of the TPTP Problem Library for
automated theorem-proving systems. The library is available via the Internet and forms a …

This book constitutes a self-contained and unified approach to automated reasoning in
multiple-valued logics (MVL) developed by the author. Moreover, it contains a virtually …

An equational system is a set of equations. Often we are interested in knowing if an equation
follows logically from the given set. For example, given the equations x+ y= y+ x,(x+ y)+ z …

We consider instantiation-based theorem proving whereby instances of clauses are
generated by certain inferences, and where inconsistency is detected by proposition tests …

In this abstract we describe version 1.1 of the theorem prover Vampire. We give a general
description and comment on Vampire's original features and differences with the previously …