Please use this identifier to cite or link to this item: doi:10.22028/D291-39680
Title: Opening the AC-Unification Race
Author(s): Bürckert, Hans-Jürgen
Herold, Alexander
Kapur, Deepak
Siekmann, Jörg H.
Stickel, Mark E.
Tepp, Michael
Zhang, Hantao
Language: English
Year of Publication: 1988
Place of publication: Kaiserslautern
Free key words: Theory unification
AC-unification
linear Diophantine equation
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: 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.
Link to this record: urn:nbn:de:bsz:291--ds-396804
hdl:20.500.11880/35793
http://dx.doi.org/10.22028/D291-39680
Series name: SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447]
Series volume: 88,11
Date of registration: 9-May-2023
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Professorship: SE - Sonstige
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes



Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.