Computer algebra: symbolic and algebraic computation (2nd ed.)
Computer algebra: symbolic and algebraic computation (2nd ed.)
A course in computational algebraic number theory
A course in computational algebraic number theory
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Solution formula construction for truth invariant cad's
Solution formula construction for truth invariant cad's
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Generalizing DPLL to Richer Logics
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
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
SAT solving for termination analysis with polynomial interpretations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
CAV'07 Proceedings of the 19th international conference on Computer aided verification
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Satisfiability of non-linear (Ir)rational arithmetic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Cutting to the Chase solving linear integer arithmetic
CADE'11 Proceedings of the 23rd international conference on Automated deduction
A proof-producing decision procedure for real arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
An algebraic approach for the unsatisfiability of nonlinear constraints
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Beyond first-order satisfaction: fixed points, interpolants, automata and polynomials
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Automatic detection of floating-point exceptions
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A data driven approach for algebraic loop invariants
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Constructing a single open cell in a cylindrical algebraic decomposition
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Sensitivity analysis using type-based constraints
Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages
Computation in real closed infinitesimal and transcendental extensions of the rationals
CADE'13 Proceedings of the 24th international conference on Automated Deduction
A symbiosis of interval constraint propagation and cylindrical algebraic decomposition
CADE'13 Proceedings of the 24th international conference on Automated Deduction
dReal: an SMT solver for nonlinear theories over the reals
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Time-aware relational abstractions for hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
We present a new algorithm for deciding satisfiability of non-linear arithmetic constraints. The algorithm performs a Conflict-Driven Clause Learning (CDCL)-style search for a feasible assignment, while using projection operators adapted from cylindrical algebraic decomposition to guide the search away from the conflicting states.