Showing papers in "Journal of Symbolic Computation in 2003"

TL;DR: The SAT-checkers Chaff and BerkMin are identified as significantly outperforming the rest of the SAT tools when evaluating the Boolean correctness formulae in the formal verification of superscalar and VLIW microprocessors.

TL;DR: Two modular algorithms for computing a Grobner basis for an ideal in Q[x1,..., xv] are presented which extend the modular GCD algorithms and a complete characterization of unlucky primes is given.

TL;DR: A simple algorithm for lattice reduction of polynomial matrices is described and analysed, which is adapted and applied to various tasks, including rank profile and determinant computation, transformation to Hermite and Popov canonical form,Polynomial linear system solving and short vector computation.

TL;DR: The Prolog program implements a theorem prover for classical first-order (clausal) logic which is based on the connection calculus and demonstrates a comparatively strong performance.

TL;DR: An algorithm computing the push-forward to projective space of several classes associated to a (possibly singular, reducible, non-reduced) projective scheme yields the topological Euler characteristic of the support of a projective schemes S, given the homogeneous ideal of S.

TL;DR: This paper describes the limited resource strategy (LRS), intended to improve performance of the OTTER saturation algorithm when a fixed limit is imposed on the time of a run, and gives experimental evidence that the LRS gives a considerable improvement over the OTter saturation algorithm.

TL;DR: A Mathematica package for finding recurrences for q-hypergeometric multiple sums is introduced and various computer proofs of recently discovered identities are exhibited.

TL;DR: A new method for computing the automorphism group of a finite permutation group and for testing two such groups for isomorphism is described.

TL;DR: This paper redefines the µ-basis to consist of the three polynomials p, q, r such that p,q, r can be used to recover the parametric equation P(s, t) of the rational ruled surface.

TL;DR: In this article, the authors give an alternative definition of comprehensive Grobner bases in terms of Grobners bases in polynomial rings over commutative Von Neumann regular rings.

TL;DR: The main contributions of this paper are not new results on subresultants, but rather extensions of the main results over integral rings to arbitrary commutative rings.

TL;DR: The comprehensive Grobner bases for parametric polynomial ideals were introduced, constructed, and studied by the author in 1992 as mentioned in this paper, and have been implemented in the computer algebraic algebra.

TL;DR: It is shown in this paper how these two goals can be reached to some extent by using ground joinable equations for simplification purposes and omitting them from the generation of new facts.

TL;DR: By constructing an implementable decision procedure for the GF and for the LGF, it is obtained an effective procedure for deciding modal logics that can be embedded into these fragments.

TL;DR: It is proved that there are natural fragments of the guarded fragment which can be decided by hyperresolution, and decidability of hyperresolution with or without splitting for the fragment GF1- is proved.

TL;DR: A program which facilitates storage and manipulation of finitely-presented (FP) categories and finite-set valued functors and several tools for testing properties of objects and arrows are included.

TL;DR: The design and use of Distributed Maple, an environment for executing parallel computer algebra programs on multiprocessors and heterogeneous clusters, and the use of the system for the parallelization of various functions of the algebraic geometry library CASA are described.

TL;DR: This thesis surveys algorithms for computing linear and cyclic convolution in a uniform mathematical notation that allows automatic derivation, optimization, and implementation and finds a window where CRT-based algorithms outperform other methods of computing convolutions.

TL;DR: This paper proves Sylvester formulas using the techniques of multivariate polynomials involving multi-Schur functions and divided differences to express the subresultants of two polynomial remainders of Euclidean division in terms of some double sums over the roots of the two poynomials.

TL;DR: In this paper, the authors propose three simplification techniques for bracket computation involving conic points, and an algorithm for rational Cayley factorization in conic geometry with Cayley and bracket algebras.

TL;DR: The authors' algorithm handles all of those classical groups uniformly and runs in time which is polynomial in the input length, assuming a discrete logarithm oracle for F.

TL;DR: The Grobner bases of the ideal generated by the symmetric functions are presented and it is shown how they can be fruitfully applied to a problem arising from coding theory.

TL;DR: A general algorithm is given to find this irreducible subvariety of polynomial differential systems that includes all time-reversible systems and compute its dimension.

TL;DR: It is shown that unlike other methods for computing normal forms, the technique using matching pursuit does not need any algebraic constraints which are required for the existence of the simplest normal form.

TL;DR: It is shown that refinements of resolution yield decision procedures for the universal theory of some such classes of algebras, and establishes a link between the satisfiability of universal sentences with respect to classes of distributive lattices with operators and their satisfiability withrespect to certain classes of relational structures.

TL;DR: In this article, a general form of contextual rewriting constraint contextual rewriting (CCR) is proposed for formula simplification, which allows the available decision procedure to access and manipulate the rewriting context.

TL;DR: The classification of the primitive permutation groups of degree less than 1000 is complete by determining the irreducible subgroups of GL(n,p) for p prime and pn < 1000.

TL;DR: An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra and this algorithm has been implemented for System GAP, version 4.

TL;DR: A (finite) algorithm to determine the set of characteristics of a system of polynomial equations with integer coefficients by using the theory of Grobner bases is described, giving a proof that theset of characteristics must be either finite and not containing zero, or containing zero and co-finite.

TL;DR: An algorithm to compute the projective dimension of M, a left submodule of a free module, if M is projective and rank(M) ≥ 2 is given and a procedure to find a basis is given.