Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Automata-driven indexing of Prolog clauses
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Experiments with discrimination-tree indexing and path indexing for term retrieval
Journal of Automated Reasoning
Term Indexing
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
NP-Completeness of the Set Unification and Matching Problems
Proceedings of the 8th International Conference on Automated Deduction
On the Evaluation of Indexing Techniques for Theorem Proving
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Handbook of automated reasoning
The design and implementation of VAMPIRE
AI Communications - CASC
AI Communications - CASC
AI Communications - CASC
| Hi-index | 0.00 |
Backward demodulation is a simplification technique used in saturation-based theorem proving with superposition and ordered paramodulation. It requires instance retrieval, i.e., search for instances of some term in a typically large set of terms. Path indexing is a family of indexing techniques that can be used to solve this problem efficiently. We propose a number of powerful optimisations to standard path indexing. We also describe a novel framework that combines path indexing with relational joins. The main advantage of the proposed scheme is flexibility, which we illustrate by sketching how to adapt the scheme to instance retrieval modulo commutativity and backward subsumption on multi-literal clauses.