## Completion and Equational Theorem Proving using Taxonomic Constraints

• We present an approach to prove several theorems in slightly different axiomsystems simultaneously. We represent the different problems as a taxonomy, i.e.a tree in which each node inherits all knowledge of its predecessors, and solve theproblems using inference steps on rules and equations with simple constraints,i.e. words identifying nodes in the taxonomy. We demonstrate that a substantialgain can be achieved by using taxonomic constraints, not only by avoiding therepetition of inference steps in the different problems but also by achieving runtimes that are much shorter than the accumulated run times when proving eachproblem separately.

### Weitere Dienste

Verfasserangaben: Jörg Denzinger urn:nbn:de:hbz:386-kluedo-3528 SEKI Report (95,11) Preprint Englisch 1999 1999 Technische Universität Kaiserslautern 03.04.2000 Fachbereich Informatik 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$