3 research outputs found

    Opening the AC-Unification Race

    Get PDF
    This note reports about the implementation of AC-unification algorithms, based on the variable-abstraction method of Stickel and on the constant-abstraction method of Livesey, Siekmann, and Herold. We give a set of 105 benchmark examples and compare execution times for implementations of the two approaches. This documents for other researchers what we consider to be the state-of-the-art performance for elementary AC-unification problems

    Solving Equality Reasoning Problems with a Connection Graph Theorem Prover

    Get PDF
    The integration of a Knuth-Bendix completion algorithm into a paramodulation theorem prover on the basis of a connection graph resolution procedure is presented. The Knuth-Bendix completion idea is compared to a decomposition approach, and some ideas to handle conditional equations are discussed. The contents of this paper is not intended to present new material on term rewriting, instead it is more a pleading for the usage of completion ideas in automated deduction. It records our experience with an actual implementation of a hybrid system, where a completion procedure was imbedded into a connection graph theorem prover, the MKRP-system, with satisfactory positive results

    Preprints of Proceedings of GWAI-92

    No full text
    This is a preprint of the proceedings of the German Workshop on Artificial Intelligence (GWAI) 1992. The final version will appear in the Lecture Notes in Artificial Intelligence
    corecore