English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  The Next WALDMEISTER Loop

Hillenbrand, T., & Löchner, B. (2002). The Next WALDMEISTER Loop. In A. Voronkov (Ed.), Automated deduction, CADE-18: 18th International Conference on Automated Deduction (pp. 486-500). Heidelberg, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-30F6-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-30F9-4
Genre: Conference Paper

Files

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

Locators

show

Creators

show
hide
 Creators:
Hillenbrand, Thomas1, 2, 3, Author           
Löchner, Bernd3, Author           
Affiliations:
1International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              
2Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              
3Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: In saturation-based theorem provers, the reasoning process consists in constructing the closure of an axiom set under inferences. As is well-known, this process tends to quickly fill the memory available unless preventive measures are employed. For implementations based on the DISCOUNT loop, the passive facts are responsible for most of the memory consumption. We present a refinement of that loop allowing such a compression that the space needed for the passive facts is linearly bound by the number of active facts. In practice, this will reduce memory consumption in the WALDMEISTER system by more than one order of magnitude as compared to previous compression schemes.

Details

show
hide
Language(s): eng - English
 Dates: 2007-03-202002
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 521707
Other: Local-ID: C125716C0050FB51-4D570162B4332D6DC12572A400330506-HL02-CADE18
 Degree: -

Event

show
hide
Title: CADE 2002
Place of Event: Copenhagen, Denmark
Start-/End Date: 2002-07-27 - 2002-07-30

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction
Source Genre: Proceedings
 Creator(s):
Voronkov, Andrei1, Editor           
Affiliations:
1 Programming Logics, MPI for Informatics, Max Planck Society, ou_40045            
Publ. Info: Heidelberg, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 486 - 500 Identifier: ISBN: 3-540-43931-5

Source 2

show
hide
Title: Lecture Notes in Artificial Intelligence
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2392 Sequence Number: - Start / End Page: - Identifier: -