QEPCAD
QEPCAD B: A program for computing with semi-algebraic sets using CADs. QEPCAD is an implementation of quantifier elimination by partial cylindrical algebraic decomposition due orginally to Hoon Hong, and subsequently added on to by many others. It is an interactive command-line program written in C/C++, and based on the SACLIB library. Presented here is QEPCAD B version 1.x, the ”B” designating a substantial departure from the original QEPCAD and distinguishing it from any development of the original that may proceed in a different direction. QEPCAD and the SACLIB library are the result of a program of research by George Collins and his PhD students that has spanned several decades ... and continues still! I extended and improved QEPCAD for several years. Improvements that didn’t involve changes to the way the program interacted with the user I’d just go ahead and make. However, changes that affected the interaction of QEPCAD and the user, or changes that added new features were ”tacked on” to the program, requiring the user to know about extra commands. Moreover, there was no cannonical source for QEPCAD distribution or documentation, and no internet accessible source at all. This branch of QEPCAD, QEPCAD ”B”, was introduced to address those problems - to make QEPCAD easily accessable through the internet, to provide good documentation, and to incorporate many improvements and extensions in a way that makes them most accessible to the user.
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 260 articles , 1 standard article )
Showing results 1 to 20 of 260.
Sorted by year (- McCallum, Scott; Parusiński, Adam; Paunescu, Laurentiu: Validity proof of Lazard’s method for CAD construction (2019-2019)
- Brambilla, Maria Chiara; Staglianò, Giovanni: On the algebraic boundaries among typical ranks for real binary forms (2018)
- Doyen, Laurent; Frehse, Goran; Pappas, George J.; Platzer, André: Verification of hybrid systems (2018)
- Feferman, Solomon: Tarski’s influence on computer science (2018)
- Hong, Hoon; Sturm, Thomas: Positive solutions of systems of signed parametric polynomial inequalities (2018)
- Huang, Cheng-Chao; Li, Jing-Cao; Xu, Ming; Li, Zhi-Bin: Positive root isolation for poly-powers by exclusion and differentiation (2018)
- Röbenack, Klaus; Voßwinkel, Rick; Richter, Hendrik: Automatic generation of bounds for polynomial systems with application to the Lorenz system (2018)
- Roux, Pierre; Voronin, Yuen-Lam; Sankaranarayanan, Sriram: Validating numerical semidefinite programming solvers for polynomial invariants (2018)
- Vale-Enriquez, Fernando; Brown, Christopher W.: Polynomial constraints and unsat cores in Tarski (2018)
- Djaballah, Adel; Chapoutot, Alexandre; Kieffer, Michel; Bouissou, Olivier: Construction of parametric barrier functions for dynamical systems using interval analysis (2017)
- Ghorbal, Khalil; Sogokon, Andrew; Platzer, André: A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets (2017)
- Han, Jingjun; Dai, Liyun; Hong, Hoon; Xia, Bican: Open weak CAD and its applications (2017)
- Ioakimidis, Nikolaos I.: Application of quantifier elimination to inverse buckling problems (2017)
- Rodriguez, Jose Israel; Tang, Xiaoxian: A probabilistic algorithm for computing data-discriminants of likelihood equations (2017)
- Sturm, Thomas: A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (2017)
- Wałęga, Przemysław Andrzej; Schultz, Carl; Bhatt, Mehul: Non-monotonic spatial reasoning with answer set programming modulo theories (2017)
- Wojciechowski, Piotr; Eirinakis, Pavlos; Subramani, K.: Analyzing restricted fragments of the theory of linear arithmetic (2017)
- Wojciechowski, Piotr; Eirinakis, Pavlos; Subramani, K.: Erratum to: “Analyzing restricted fragments of the theory of linear arithmetic” (2017)
- Ábrahám, Erika; Abbott, John; Becker, Bernd; Bigatti, Anna M.; Brain, Martin; Buchberger, Bruno; Cimatti, Alessandro; Davenport, James H.; England, Matthew; Fontaine, Pascal; Forrest, Stephen; Griggio, Alberto; Kroening, Daniel; Seiler, Werner M.; Sturm, Thomas: \ssfSC$^2$: satisfiability checking meets symbolic computation. (Project paper) (2016)
- Bradford, Russell; Davenport, James H.; England, Matthew; McCallum, Scott; Wilson, David: Truth table invariant cylindrical algebraic decomposition (2016)