de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Bericht

Extended path-indexing

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44517

Graf,  Peter
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44784

Kirsch,  Christoph M.
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)

MPI-I-93-253.pdf
(beliebiger Volltext), 156KB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Graf, P., & Kirsch, C. M.(1993). Extended path-indexing (MPI-I-93-253). Saarbrücken: Max-Planck-Institut für Informatik.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-B49E-6
Zusammenfassung
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 an occur--check information. Thus compared to the standard method we dismiss much more terms as possible candidates.