Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Gaillourdet, Jean-Marie
Hillenbrand, Thomas
Löchner, Bernd
Spies, Hendrik

dblp
dblp
dblp
dblp

Not MPG Author(s):

Gaillourdet, Jean-Marie
Löchner, Bernd
Spies, Hendrik

Editor(s):

Baader, Franz

dblp

Not MPII Editor(s):

Baader, Franz

BibTeX cite key*:

GaillourdetHillenbrandLoechner2003

Title, Booktitle

Title*:

The New WALDMEISTER Loop at Work


pwm.ps (110.22 KB)

Booktitle*:

Automated deduction, CADE-19 : 19th International Conference on Automated Deduction

Event, URLs

URL of the conference:

http://www.cade-19.info/

URL for downloading the paper:


Event Address*:

Miami, Florida

Language:

English

Event Date*
(no longer used):

July, 30 - August, 2

Organization:


Event Start Date:

28 July 2003

Event End Date:

2 August 2003

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Artificial Intelligence

Volume:

2741

Number:


Month:


Pages:

317-321

Year*:

2003

VG Wort Pages:

15

ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We present recent developments within the theorem prover \textsc{Waldmeister}. They rely on a novel organization of the underlying saturation-based proof procedure into a system architecture. As is known, the saturation process tends to quickly fill the memory available unless preventive measures are employed. To overcome this problem, our new ``\textsc{Waldmeister} loop'' features a highly compact representation of the search state, exploiting its inherent structure. The implementation just being available, the cost and the benefits of the concept now can exactly be measured. Indeed are our expectations met concerning the drastic cut-down of memory usage with only moderate overhead of time.

In addition it has turned out that the revealed structure of the search state paves the way to an easily implemented parallelization of the prover with modest communication requirements and rewarding speed-ups. In order to minimize communication-related latencies, we discuss some variations of the loop to maximally profit from multiple processors.

URL for the Abstract:

Equational Reasoning, Implementation of Logics



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

popular

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{GaillourdetHillenbrandLoechner2003,
AUTHOR = {Gaillourdet, Jean-Marie and Hillenbrand, Thomas and L{\"o}chner, Bernd and Spies, Hendrik},
EDITOR = {Baader, Franz},
TITLE = {The New {WALDMEISTER} Loop at Work},
BOOKTITLE = {Automated deduction, CADE-19 : 19th International Conference on Automated Deduction},
PUBLISHER = {Springer},
YEAR = {2003},
VOLUME = {2741},
PAGES = {317--321},
SERIES = {Lecture Notes in Artificial Intelligence},
ADDRESS = {Miami, Florida},
}


Entry last modified by Viorica Sofronie-Stokkermans, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Thomas Hillenbrand
Created
04/07/2003 10:20:34 AM
Revisions
13.
12.
11.
10.
9.
Editor(s)
Viorica Sofronie-Stokkermans
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
06/23/2004 02:13:26 PM
17.06.2004 16:01:15
17.06.2004 14:58:29
17.06.2004 14:57:58
08/02/2003 08:29:06 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
pwm.ps