Cylindrical algebraic decomposition II: an adjacency algorithm for the plane
SIAM Journal on Computing
The complexity of linear problems in fields
Journal of Symbolic Computation
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
Journal of Symbolic Computation
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Algorithmic algebra
Quantifier elimination for real algebra—the cubic case
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
Simplification of truth-invariant cylindrical algebraic decompositions
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Guaranteed solution formula construction
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Solving systems of strict polynomial inequalities
Journal of Symbolic Computation
Simple CAD construction and its applications
Journal of Symbolic Computation
Improved projection for cylindrical algebraic decomposition
Journal of Symbolic Computation
Interval arithmetic in cylindrical algebraic decomposition
Journal of Symbolic Computation
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
An Improved Projection Operation for Cylindrical Algebraic Decomposition
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Topologically reliable display of algebraic curves
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
Solution formula construction for truth invariant cad's
Solution formula construction for truth invariant cad's
On using bi-equational constraints in CAD construction
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Implementing the cylindrical algebraic decomposition within the Coq system
Mathematical Structures in Computer Science
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Symbolic optimization of algebraic functions
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Quantifier Elimination for Approximate Factorization of Linear Partial Differential Operators
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Prover's Palette: A User-Centric Approach to Verification with Isabelle and QEPCAD-B
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
MetiTarski: An Automatic Prover for the Elementary Functions
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Combining Isabelle and QEPCAD-B in the Prover's Palette
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Hybrid Automata in Systems Biology: How Far Can We Go?
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Symbolic Computation
Periodically Controlled Hybrid Systems
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Automatic computation of the complete root classification for a parametric polynomial
Journal of Symbolic Computation
Combined Decision Techniques for the Existential Theory of the Reals
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
On delineability of varieties in CAD-based quantifier elimination with two equational constraints
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Proceedings of the 2009 conference on Symbolic numeric computation
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hybrid automata, reachability, and Systems Biology
Theoretical Computer Science
On proving the absence of oscillations in models of genetic circuits
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Extending a resolution prover for inequalities on elementary functions
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Computation with semialgebraic sets represented by cylindrical algebraic formulas
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Triangular decomposition of semi-algebraic systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
When can we detect that a P-finite sequence is positive?
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
On solving systems of bivariate polynomials
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
The 5th IJCAR automated theorem proving system competition - CASC-J5
AI Communications
ACM Communications in Computer Algebra
A constraint satisfaction framework for executing perceptions and actions in diagrammatic reasoning
Journal of Artificial Intelligence Research
Towards flight control verification using automated theorem proving
NFM'11 Proceedings of the Third international conference on NASA Formal methods
GiNaCRA: a C++ library for real algebraic computations
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Verification and synthesis using real quantifier elimination
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Dominance in the family of Sugeno--Weber t-norms
Fuzzy Sets and Systems
Virtual substitution for SMT-solving
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Computing semi-algebraic invariants for polynomial dynamical systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Chemical reaction systems, computer algebra and systems biology
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Optimal control of piece-wise polynomial hybrid systems using cylindrical algebraic decomposition
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Computing the real solutions of polynomial systems with the RegularChains library in Maple
ACM Communications in Computer Algebra
Compiler-enforced memory semantics in the SACLIB computer algebra library
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Efficient preprocessing methods for quantifier elimination
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
An algorithm for computing the complete root classification of a parametric polynomial
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Variant quantifier elimination
Journal of Symbolic Computation
The TPTP typed first-order form with arithmetic
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
SMT-RAT: an SMT-compliant nonlinear real arithmetic toolbox
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Speeding up cylindrical algebraic decomposition by gröbner bases
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Integrating Systems around the User: Combining Isabelle, Maple, and QEPCAD in the Prover's Palette
Electronic Notes in Theoretical Computer Science (ENTCS)
Making resource analysis practical for real-time Java
Proceedings of the 10th International Workshop on Java Technologies for Real-time and Embedded Systems
Symbolic termination analysis of solvable loops
Journal of Symbolic Computation
Triangular decomposition of semi-algebraic systems
Journal of Symbolic Computation
ACM Communications in Computer Algebra
Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Theoretical Computer Science
Cylindrical algebraic decompositions for boolean combinations
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Termination conditions for positivity proving procedures
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
JBernstein: a validity checker for generalized polynomial constraints
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Optimising problem formulation for cylindrical algebraic decomposition
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Synthesizing switching controllers for hybrid systems by generating invariants
Theories of Programming and Formal Methods
Time-aware relational abstractions for hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Note: On the complexity of quantified linear systems
Theoretical Computer Science
A local Fourier convergence analysis of a multigrid method using symbolic computation
Journal of Symbolic Computation
Hi-index | 0.00 |
This report introduces QEPCAD, B, a program for computing with real algebraic sets using cylindrical algebraic decomposition (CAD). QEPCAD B both extends and improves upon the QEPCAD system for quantifier elimination by partial cylindrical algebraic decomposition written by Hoon Hong in the early 1990s. This paper briefly discusses some of the improvements in the implementation of CAD and quantifier elimination via CAD, and provides somewhat more detail on extensions to the system that go beyond quantifier elimination. The author is responsible for most of the extended features of QEPCAD B, but improvements to the basic CAD implementation and to the SACLIB library on which QEPCAD is based are the results of many people's work, including: George E. Collins, Mark J. Encarnación, Hoon Hong, Jeremy Johnson, Werner Krandick, Richard Liska, Scott McCallum, Nicolas Robidoux, and Stanly Steinberg. Source code, documentation and installation instructions for QEPCAD B are all available at www.cs.usna.edu/~qepcad.