Item

Abstract

The term ``Parallel unit resulting resolution'' refers to a modified unit resulting resolution rule working on sets of substitutions. We modified the inference rule in order to investigate term indexing and to exploit parallelism in automated reasoning. Term indexing supports the construction of efficient automated reasoning systems by providing rapid access to first-order predicate calculus terms with specific properties. The theoretical background and the implementation of a theorem prover called {\sc Purr} which implements parallel unit resulting resolution as well as experiments with {\sc Purr} are presented in this thesis. The author addresses the reader interested in new indexing techniques and in distributed theorem proving.