The Inductive Theorem Prover INKA, Version 4.0 Visit also the description of the new INKA 5.0 system The INKA-system 4.0 is a first-order theorem prover with induction which is based on the explicit induction paradigm. It is based on a full first-order calculus (a special variant of the resolution calculus with paramodulation) Main Features: - The system possesses a powerful predicate-logic prover component which (as already mentioned) is based on an order- sorted variant of a resolution calculus with paramodulation. A variety of definition principles are offered to define data types (with free constructors as well as with non-free constructors), functions and predicates. For functions and predicates additional definition principles are offered for algorithmic specifications. A built-in recursion analysis ensures the termination of the above mentioned algorithms. The encoded well-founded order relation can then be used to formulate the induction axioms. Sophisticated heuristics based on the notions of rippling and of colouring formulas are used to guide the proof search by proof plans. In either way, if the proof search succeeds or if the proof search fails, the user is offered a (graphical) representation of the proof attempt. The user can interact with the system by giving the system some advice for filling the gap in the proof sketch.
| |
|
