![]() ![]() ![]() COMPIT |
![]() |
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Let's COMPIT
A method for COMParing Indexing Techniques for automated deduction |
If you use automated deduction for your application, you probably use some kind of indexing technique for terms. This technique may even be crucial to the efficiency of your program. But do you know how efficient it really is? Compared to others? |
If you are an implementor and you need to know which indexing technique is likely to behave best for your application, or if you are a developer of new indexing techniques, you need to be able to compare techniques in order to get intuition about where to search for improvements, and in order to provide scientific evidence of the superiority of new techniques over other previous ones. |
Are you sure your implementation works error free? |
Compit is a test-framework which allows you to compare indexing techniques for automated deduction. More
on Compit you can find in the IJCAR paper "On the Evaluation of Indexing
Techniques for Theorem Proving". |
COMPIT tackles the following indexing problems: retrieval of generalization (forward matching) and unification.
It is intended to cope with instances (backward matching) soon.
The following indexing techniques are already included in the framework:
|
Useful if you want to compare the efficiency of your indexing technique with others. The currently most up-to-date results of efficiency tests in the COMPIT framework are the ones given on the statistics page. |
From
our download page, you can get the benchmark files that where used for the
Compit testing framework. |
Robert
Nieuwenhuis
Thomas Hillenbrand
revised and supplemented for the WWW by Doris Diedrich