Self-adjusting binary search trees
Journal of the ACM (JACM)
NP-completeness of the set unification and matching problems
Proc. of the 8th international conference on Automated deduction
Experiments with discrimination-tree indexing and path indexing for term retrieval
Journal of Automated Reasoning
33 basic test problems: a practical evaluation of some paramodulation strategies
Automated reasoning and its applications
Term Indexing
DISCOUNT - A Distributed and Learning Equational Prover
Journal of Automated Reasoning
Information-Based Selection of Abstraction Levels
Proceedings of the Fourteenth International Florida Artificial Intelligence Research Society Conference
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Handbook of automated reasoning
Combining superposition, sorts and splitting
Handbook of automated reasoning
The design and implementation of VAMPIRE
AI Communications - CASC
AI Communications - CASC
AI Communications - CASC
iProver --- An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Engineering DPLL(T) + Saturation
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A comparison of reasoning techniques for querying large description logic ABoxes
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Fingerprint indexing for paramodulation and rewriting
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Hi-index | 0.00 |
This paper describes feature vector indexing, a new, non-perfect indexing method for clause subsumption. It is suitable for both forward (i.e., finding a subsuming clause in a set) and backward (finding all subsumed clauses in a set) subsumption. Moreover, it is easy to implement, but still yields excellent performance in practice. As an added benefit, by restricting the selection of features used in the index, our technique immediately adapts to indexing modulo arbitrary AC theories with only minor loss of efficiency. Alternatively, the feature selection can be restricted to result in set subsumption. Feature vector indexing has been implemented in our equational theorem prover E, and has enabled us to integrate new simplification techniques making heavy use of subsumption. We experimentally compare the performance of the prover for a number of strategies using feature vector indexing and conventional sequential subsumption.