Results 1  10
of
23
A Completion Procedure for Computing a Canonical Basis for a kSubalgebra
 IN COMPUTERS AND MATHEMATICS
, 1989
"... A completion procedure for computing a canonical basis for a ksubalgebra is proposed. Using this canonical basis, the membership problem for a ksubalgebra can be solved. The approach follows Buchberger's approach for computing a Gröbner basis for a polynomial ideal and is based on rewritin ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
A completion procedure for computing a canonical basis for a ksubalgebra is proposed. Using this canonical basis, the membership problem for a ksubalgebra can be solved. The approach follows Buchberger's approach for computing a Gröbner basis for a polynomial ideal and is based on rewriting concepts. A canonical basis produced by the completion procedure shares many properties of a Grobner basis such as reducing an element of a ksubalgebra to 0 and generating unique normal forms for the equivalence classes generated by a ksubalgebra. In contrast to Shannon and Sweedler's approach using tag variables, this approach is direct. One of the limitations of the approach however is that the procedure may not terminate for some term orderings thus giving an infinite canonical basis. The procedure is illustrated using examples.
Ideal Membership in Polynomial Rings over the Integers
 J. Amer. Math. Soc
"... Abstract. We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials f0, f1,..., fn ∈ Z[X], where X = (X1,..., XN) is an Ntuple of indeterminates, are there g1,..., gn ∈ Z[X] such that f0 = g1f1 + · · · + gnfn? We show that the degree of th ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
(Show Context)
Abstract. We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials f0, f1,..., fn ∈ Z[X], where X = (X1,..., XN) is an Ntuple of indeterminates, are there g1,..., gn ∈ Z[X] such that f0 = g1f1 + · · · + gnfn? We show that the degree of the polynomials g1,..., gn can be bounded by (2d) 2O(N2) (h + 1) where d is the maximum total degree and h the maximum height of the coefficients of f0,..., fn. Some related questions, primarily concerning linear equations in R[X], where R is the ring of integers of a number field, are also treated.
An Eunification algorithm for analyzing protocols that use modular exponentiation
, 2003
"... Modular multiplication and exponentiation are common operations in modern cryptography. Uni cation problems with respect to some equational theories that these operations satisfy are investigated. Two dierent but related equational theories are analyzed. A uni cation algorithm is given for one of ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Modular multiplication and exponentiation are common operations in modern cryptography. Uni cation problems with respect to some equational theories that these operations satisfy are investigated. Two dierent but related equational theories are analyzed. A uni cation algorithm is given for one of the theories which relies on solving syzygies over multivariate integral polynomials with noncommuting indeterminates. For the other theory, in which the distributivity property of exponentiation over multiplication is assumed, the uni ability problem is shown to be undecidable by adapting a construction developed by one of the authors to reduce Hilbert's 10th problem to the solvability problem for linear equations over semirings. A new algorithm for computing strong Grobner bases of right ideals over the polynomial semiring Z<X 1 ; : : : ; Xn> is proposed; unlike earlier algorithms proposed by Baader as well as by Madlener and Reinert which work only for right admissible term orderings with the boundedness property, this algorithm works for any right admissible term ordering. The algorithms for some of these uni cation problems are expected to be integrated into Research supported in part by the NSF grant nos. CCR0098114 and CDA9503064, the ONR grant no. N000140110429, and a grant from the Computer Science Research Institute at Sandia National Labs.
Normalised Rewriting and Normalised Completion
, 1994
"... We introduce normalised rewriting, a new rewrite relation. It generalises former notions of rewriting modulo E, dropping some conditions on E. For example, E can now be the theory of identity, idempotency, the theory of Abelian groups, the theory of commutative rings. We give a new completion algor ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
We introduce normalised rewriting, a new rewrite relation. It generalises former notions of rewriting modulo E, dropping some conditions on E. For example, E can now be the theory of identity, idempotency, the theory of Abelian groups, the theory of commutative rings. We give a new completion algorithm for normalised rewriting. It contains as an instance the usual AC completion algorithm, but also the wellknown Buchberger's algorithm for computing standard bases of polynomial ideals. We investigate the particular case of completion of ground equations, In this case we prove by a uniform method that completion modulo E terminates, for some interesting E. As a consequence, we obtain the decidability of the word problem for some classes of equational theories. We give implementation results which shows the efficiency of normalised completion with respect to completion modulo AC. 1 Introduction Equational axioms are very common in most sciences, including computer science. Equations can ...
AN EQUATIONAL APPROACH TO THEOREM PROVING in firstorder predicate calculus
, 1985
"... A new approach for proving theorems in firstorder predicate calculus is developed based on term rewriting and polynomial simplification methods. A formula is translat ed into an equivalent set of formulae expressed in terms of 'true', 'false', 'exclusiveor', and &apos ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
A new approach for proving theorems in firstorder predicate calculus is developed based on term rewriting and polynomial simplification methods. A formula is translat ed into an equivalent set of formulae expressed in terms of 'true', 'false', 'exclusiveor', and 'and' by analyzing the semantics of its toplevel operator. In this representation, formulae are polynomials over atomic formulae with 'and' as multiplication and 'exclusiveor' as addition, and they can be manipulated just like polynomials using familiar rules of multiplication and addition. Polynomials representing a formula are converted into rewrite rules which are used to simplify polynomials. New rules are generated by overlapping polynomials using a criticalpair completion procedure closely related to the Knuth Bendix procedure. This process is repeated until a contradiction is reached or it is no longer possible to generate new rules. It is shown that resolution is subsumed by this method.
Buchberger's algorithm: A constraintbased completion procedure
, 1994
"... We present an extended completion procedure with builtin theories defined by a collection of associativity and commutativity axioms and additional ground equations, and reformulate Buchberger's algorithm for constructing Gröbner bases for polynomial ideals in this formalism. The presentation o ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We present an extended completion procedure with builtin theories defined by a collection of associativity and commutativity axioms and additional ground equations, and reformulate Buchberger's algorithm for constructing Gröbner bases for polynomial ideals in this formalism. The presentation of completion is at an abstract level, by transition rules, with a suitable notion of fairness used to characterize a wide class of correct completion procedures, among them Buchberger's original algorithm for polynomial rings over a field.
String rewriting and Gröbner bases  a general approach to monoid and group rings
 Proceedings of the Workshop on Symbolic Rewriting Techniques, Monte Verita
, 1995
"... The concept of algebraic simplification is of great importance for the field of symbolic computation in computer algebra. In this paper we review some fundamental concepts concerning reduction rings in the spirit of Buchberger. The most important properties of reduction rings are presented. The tech ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
The concept of algebraic simplification is of great importance for the field of symbolic computation in computer algebra. In this paper we review some fundamental concepts concerning reduction rings in the spirit of Buchberger. The most important properties of reduction rings are presented. The techniques for presenting monoids or groups by string rewriting systems are used to define several types of reduction in monoid and group rings. Grobner bases in this setting arise naturally as generalizations of the corresponding known notions in the commutative and some noncommutative cases. Several results on the connection of the word problem and the congruence problem are proven. The concepts of saturation and completion are introduced for monoid rings having a finite convergent presentation by a semiThue system. For certain presentations, including free groups and contextfree groups, the existence of finite Grobner bases for finitely generated right ideals is shown and a procedure to com...
Superposition Theorem Proving for Abelian Groups Represented as Integer Modules
 THEORETICAL COMPUTER SCIENCE
, 1996
"... We define a superposition calculus specialized for abelian groups represented as integer modules, and show its refutational completeness. This allows to substantially reduce the number of inferences compared to a standard superposition prover which applies the axioms directly. Specifically, equation ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
We define a superposition calculus specialized for abelian groups represented as integer modules, and show its refutational completeness. This allows to substantially reduce the number of inferences compared to a standard superposition prover which applies the axioms directly. Specifically, equational literals are simplified, so that only the maximal term of the sums is on the lefthand side. Only certain minimal superpositions need to be considered; other superpositions which a standard prover would consider become redundant. This not only reduces the number of inferences, but also reduces the size of the ACunification problems which are generated. That is, ACunification is not necessary at the top of a term, only below some nonACsymbol. Further, we consider situations where the axioms give rise to variable overlaps and develop techniques to avoid these explosive cases where possible.
Solving Linear Equations Over Polynomial Semirings
 RUTGER UNIVERSITY (NJ
"... We consider the problem of solving linear equations over various semirings. In particular, solving of linear equations over polynomial rings with the additional restriction that the solutions must have only nonnegative coefficients is shown to be undecidable. Applications to undecidability proofs o ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We consider the problem of solving linear equations over various semirings. In particular, solving of linear equations over polynomial rings with the additional restriction that the solutions must have only nonnegative coefficients is shown to be undecidable. Applications to undecidability proofs of several unification problems are illustrated, one of which, unification modulo one associativecommutative function and one endomorphism, has been a longstanding open problem. The problem of solving multiset constraints is also shown to be undecidable.