Volker Weispfenning

Publication Activity (10 Years)

Years Active: 1976-2012
Publications (10 Years): 0

Top Venues

J. Symb. Comput.

Publications

Scott McCallum, Volker Weispfenning
Deciding polynomial-transcendental problems. J. Symb. Comput. 47 (1) (2012)
Melanie Achatz, Scott McCallum, Volker Weispfenning
Deciding polynomial-exponential problems. ISSAC (2008)
Andreas Dolzmann, Volker Weispfenning
Multiple object semilinear motion planning. J. Symb. Comput. 42 (3) (2007)
Volker Weispfenning
Robust Stability for Parametric Linear ODEs. CASC (2007)
Volker Weispfenning
Comprehensive Gröbner bases and regular rings. J. Symb. Comput. 41 (3-4) (2006)
Volker Weispfenning
Solving Linear Differential Problems with Parameters. CASC (2005)
Volker Weispfenning
Model Theory of Lattice Products. Algorithmic Algebra and Logic (2005)
Volker Weispfenning
Solving Constraints by Elimination Methods. IJCAR (2004)
Volker Weispfenning
Canonical comprehensive Gröbner bases. J. Symb. Comput. 36 (3-4) (2003)
Volker Weispfenning
Canonical comprehensive Gröbner bases. ISSAC (2002)
Hirokazu Anai, Volker Weispfenning
Reach Set Computations Using Real Quantifier Elimination. HSCC (2001)
Volker Weispfenning
Semilinear Motion Planning Among Moving Objects in REDLOG. CASC (2001)
Volker Weispfenning
Semilinear Motion Planning in REDLOG. Appl. Algebra Eng. Commun. Comput. 12 (6) (2001)
Volker Weispfenning
Deciding linear-exponential problems. SIGSAM Bull. 34 (1) (2000)
Andreas Dolzmann, Volker Weispfenning
Local quantifier elimination. ISSAC (2000)
Hirokazu Anai, Volker Weispfenning
Deciding linear-trigonometric problems. ISSAC (2000)
Volker Weispfenning
Mixed Real-Integer Linear Quantifier Elimination. ISSAC (1999)
Andreas Dolzmann, Thomas Sturm, Volker Weispfenning
A New Approach for Automatic Theorem Proving in Real Geometry. J. Autom. Reason. 21 (3) (1998)
Volker Weispfenning
Quantifier Elimination for Real Algebra - the Quadratic Case and Beyond. Appl. Algebra Eng. Commun. Comput. 8 (2) (1997)
Andreas Dolzmann, Thomas Sturm, Volker Weispfenning
Real Quantifier Elimination in Practice. Algorithmic Algebra and Number Theory (1997)
Volker Weispfenning
Complexity and Uniformity of Elimination in Presburger Arithmetic. ISSAC (1997)
Volker Weispfenning
Simulation and Optimization by Quantifier Elimination. J. Symb. Comput. 24 (2) (1997)
Thomas Sturm, Volker Weispfenning
Computational Geometry Problems in REDLOG. Automated Deduction in Geometry (1996)
Volker Weispfenning
Quantifier Elimination for Real Algebra - the Cubic Case. ISSAC (1994)
Rüdiger Loos, Volker Weispfenning
Applying Linear Quantifier Elimination. Comput. J. 36 (5) (1993)
Volker Weispfenning
Differential Term-Orders. ISSAC (1993)
Volker Weispfenning
Comprehensive Gröbner Bases. J. Symb. Comput. 14 (1) (1992)
Volker Weispfenning
Finite Gröbner Bases in Non-Noetherian Skew Polynomial Rings. ISSAC (1992)
Gunter Ritter, Volker Weispfenning
On the Number of Term Orders. Appl. Algebra Eng. Commun. Comput. 2 (1991)
Thomas Becker, Volker Weispfenning
The Chinese Remainder Problem, Multivariate Interpolation, and Gröbner Bases. ISSAC (1991)
Abdelilah Kandri-Rody, Volker Weispfenning
Non-Commutative Gröbner Bases in Algebras of Solvable Type. J. Symb. Comput. 9 (1) (1990)
Volker Weispfenning
The Complexity of Almost Linear Diophantine Problems. J. Symb. Comput. 10 (5) (1990)
Volker Weispfenning
Existential equivalence of ordered abelian groups with parameters. Arch. Math. Log. 29 (4) (1990)
Volker Weispfenning
Efficient Decision Procedures for Locally Finite Theories II. ISSAC (1988)
Volker Weispfenning
The Complexity of Linear Problems in Fields. J. Symb. Comput. 5 (1/2) (1988)
Heinz Kredel, Volker Weispfenning
Computing Dimension and Independent Sets for Polynomial Ideals. J. Symb. Comput. 6 (2/3) (1988)
Volker Weispfenning
Gröbner bases for polynomial ideals over commutative regular rings. EUROCAL (1987)
Volker Weispfenning
Constructing Universal Groebner Bases. AAECC (1987)
Volker Weispfenning
Admissible orders and linear forms. SIGSAM Bull. 21 (2) (1987)
Volker Weispfenning
Some Bounds for the Construction of Gröbner Bases. AAECC (1986)
Volker Weispfenning
Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs. CADE (1986)
Volker Weispfenning
The Complexity of the Word Problem for Abelian l-Groups. Theor. Comput. Sci. 48 (3) (1986)
Volker Weispfenning
Quantifier elimination for modules. Arch. Math. Log. 25 (1) (1985)
Volker Weispfenning
Efficient Decision Algorithms for Locally Finite Theories. AAECC (1985)
Volker Weispfenning
Quantifier Elimination for Distributive Lattices and Measure Algebras. Math. Log. Q. 31 (14-18) (1985)
Volker Weispfenning
The Complexity of Elementary Problems in Archimedean Ordered Groups. European Conference on Computer Algebra (2) (1985)
Volker Weispfenning
The Model-Theoretic Significance of Complemented Existential Formulas. J. Symb. Log. 46 (4) (1981)
Volker Weispfenning
-categorical model-companions. Arch. Math. Log. 19 (1) (1978)
Volker Weispfenning
Nullstellensätze - A Model Theoretic Framework. Math. Log. Q. 23 (36) (1977)
Volker Weispfenning
Negative-Existentially Complete Structures and Definability in Free Extensions. J. Symb. Log. 41 (1) (1976)