TY - INPR
A1 - Denzinger, Jörg
T1 - Completion and Equational Theorem Proving using Taxonomic Constraints
N2 - 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.
T3 - SEKI Report - 95,11
Y1 - 1999
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/381
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-3528
ER -