English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Parallel Unit Resulting Resolution

Meyer, C. (1996). Parallel Unit Resulting Resolution. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is

Files

show Files
hide Files
:
meyer.ps (Any fulltext), 2MB
 
File Permalink:
-
Name:
meyer.ps
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/postscript
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Meyer, Christoph1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-1219961996
 Publication Status: Issued
 Pages: -
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519610
Other: Local-ID: C1256104005ECAFC-CB093F8D8C5B3361C12562FA006018C0-Meyer-Diplom96
 Degree: Master

Event

show

Legal Case

show

Project information

show

Source

show