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

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Substitution Tree Indexing

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

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

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

Graf, P. (1995). Substitution Tree Indexing. In A. Bundy (Ed.), Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA-95) (pp. 117-131). Heidelberg, Germany: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-AD22-F
Zusammenfassung
This article addresses the problem of maintaining and retrieving first-order predicate calculus terms in context of automatic reasoning. A new indexing technique that accelerates the speed of the basic retrieval operations, such as finding complementary literals in resolution theorem proving or finding critical pairs during completion is presented. Subsumption and reduction are also supported. Moreover, the new index not only provides maintenance and efficient retrieval of terms but also of idempotent substitutions. Substitution trees achieve maximal search speed paired with minimal memory requirements in various experiments and outperform traditional techniques such as path indexing, discrimination tree indexing and abstraction trees by combining their advantages and adding some new features.