The classic string indexing problem is to preprocess a S into compact data structure that supports efficient pattern matching queries. Typical queries include existential (decide if the occurs in S), reporting (return all positions where occurs), and counting number of occurrences pattern). In this paper we consider variant indexing, goal compactly represent such given two patterns $$P_1$$ $$P_...

Different methods for term retrieval in deduction systems have been introduced in literature. This report reviews 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 impl...