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):

Graf, Peter

dblp



Editor(s):

Bundy, Alan

dblp



BibTeX cite key*:

Graf-94-cade

Title, Booktitle

Title*:

Extended Path-Indexing

Booktitle*:

Proceedings of the 12th International Conference on Automated Deduction (CADE-12)

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Nancy, France

Language:

English

Event Date*
(no longer used):

June 26 - July 1, 1994

Organization:


Event Start Date:

26 August 2019

Event End Date:

26 August 2019

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

814

Number:


Month:


Pages:

514-528

Year*:

1994

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©

Note:

There is an extended version of this paper published as report MPII-I-93-253

(LaTeX) Abstract:

The performance of a theorem prover crucially depends on the speed of the basic retrieval operations, such as finding terms that are unifiable with (instances of, or more general than) some query term. Among the known indexing methods for term retrieval in deduction systems, Path--Indexing exhibits a good performance in general. However, as Path--Indexing is not a perfect filter, the candidates found by this method have still to be subjected to a unification algorithm in order to detect occur--check failures and indirect clashes. As perfect filters, discrimination trees and abstraction trees thus outperform Path--Indexing in some cases. We present an improved version of Path--Indexing that provides both the query trees and the Path--Index with indirect clash and occur--check information. Thus compared to the standard method we dismiss much more terms as possible candidates.



Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

experts only

Appearance:



BibTeX Entry:

@INPROCEEDINGS{Graf-94-cade,
AUTHOR = {Graf, Peter},
EDITOR = {Bundy, Alan},
TITLE = {Extended Path-Indexing},
BOOKTITLE = {Proceedings of the 12th International Conference on Automated Deduction (CADE-12)},
PUBLISHER = {Springer},
YEAR = {1994},
VOLUME = {814},
PAGES = {514--528},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Nancy, France},
NOTE = {There is an extended version of this paper published as report MPII-I-93-253},
}


Entry last modified by Uwe Brahm/MPII/DE, 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)
Uwe Brahm
Created
01/14/1995 06:51:37 PM
Revisions
12.
11.
10.
9.
8.
Editor(s)
Uwe Brahm/MPII/DE
Christine Kiesel/AG2/MPII/DE
Christine Kiesel/AG2/MPII/DE
Christine Kiesel/AG2/MPII/DE
Christine Kiesel/AG2/MPII/DE
Edit Dates
30.03.95 21:38:47
24/02/95 11:08:04
20/02/95 18:52:45
16/02/95 18:38:45
16/02/95 18:38:09