BibTeX
@INPROCEEDINGS{Hutter96inka:the,
author = {Dieter Hutter and Claus Sengler},
title = {INKA: The Next Generation},
booktitle = {},
year = {1996},
pages = {288--292},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. The INKA system is a first-order theorem prover with induction based on the explicit induction paradigm. Since 1986 when a first version of the INKA system was developed there have been many improvements. In this description we will give a short overview of the current system state and its abilities. 1 Introduction The original INKA system dates back to 1986 [2]. The current version of the INKA system which will be described below has been developed at DFKI GmbH 1 between 1991 and 1995. The INKA system is a first-order theorem prover with induction based on the explicit induction paradigm. In contrast to Nqthm, the Boyer-Moore prover, [3], the system is based on a full first-order calculus, a special variant of an ordersorted resolution calculus with paramodulation, [7]. However, it is not specialized on inductive proofs but possesses a powerful predicate-logic proof component. INKA is designed to be used for practical applications of inductive theorem proving, for instance, in th...
Citations
| 505 | A Computational Logic - Boyer, Moore - 1979 |
| 157 | Rippling: A Heuristic for Guiding Inductive Proofs - Bundy, Stevens, et al. - 1991 |
| 61 | Guiding Inductive Proofs - Hutter - 1990 |
| 42 | On proving the termination of algorithms by machine - Walther - 1994 |
| 30 | The Karlsruhe Induction Theorem Proving System - Biundo, Hummel, et al. - 1986 |
| 25 | Colouring Terms to Control Equational Reasoning - Hutter - 1997 |
| 14 | Automatisierung von Terminierungsbeweisen fur rekursiv definierte Algorithmen - Giesl - 1995 |
| 10 | Termination of Algorithms over Non-freely Generated Data Types - Sengler - 1996 |
| 3 | Adapting a Resolution Calculus for Inductive Proofs - Hutter - 1992 |
