MPI-I-92-237. April 1992, 12 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
Different methods for term retrieval in deduction systems have been introduced in literature. This report eviews the three indexing techniques discrimination indexing, path indexing, and abstraction tree indexing. A formal approach to path indexing is presented and algorithms as well as data structures of an existing implementation are discussed. Eventually, experiments will show that our implementation outperforms the implementation of path indexing in the OTTER theorem prover.
Categories / Keywords: Term Retrieval, Discrimination Tree Indexing, Path-Indexing, Abstraction Tree Indexing, Query Tree
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|MPI-I-92-237.pdf||96 KBytes; 141 KBytes|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|