Please use this identifier to cite or link to this item: doi:10.22028/D291-40372
Title: Unification in Commutative Theories, Hilbert's Basis Theorem, and Gröbner Bases
Author(s): Baader, Franz
Language: English
Year of Publication: 1990
Place of publication: Kaiserslautern
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: Unification in a commutative theory E may be reduced to solving linear equations in the corresponding semiring S(E) (Nutt (1988)). The unification type of E can thus be characterized by algebraic properties of S(E). The theory of abelian groups with n commuting homomorphisms corresponds to the semiring Z[X1,...,Xn]. Thus Hilbert’s Basis Theorem can be used to show that this theory is unitary. But this argument does not yield a unification algorithm. Linear equations in Z[X1,..,Xn] can be solved with the help of Gröbner Base methods, which thus provide the desired algorithm. The theory of abelian monoids with a homomorphism is of type zero (Baader (1988)). This can also be proved by using the fact that the corresponding semiring, namely N[X], is not noetherian. An other example of a semiring (even ring), which is not noetherian, is the ring Z<X1,...,Xn>, where X1, ..., Xn ( n > 1 ) are non-commuting indeterminates. This semiring corresponds to the theory of abelian groups with n non-commuting homomorphisms. Surprisingly, by construction of a Gröbner Base algorithm for right ideals in Z<X1,...,Xn>, it can be shown that this theory is unitary unifying.
Link to this record: urn:nbn:de:bsz:291--ds-403725
hdl:20.500.11880/36388
http://dx.doi.org/10.22028/D291-40372
Series name: SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447]
Series volume: 90,1
Date of registration: 5-Sep-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.