January 01, 2012 conference-paper Solving Non-linear Arithmetic Lecture notes in computer science DOI: 10.1007/978-3-642-31365-3_27 OpenAlex Authors 0 Author list not loaded yet. Cited by 9 stored of 230 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access On Projective Delineability 2024 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) conference-paper Computer Science Polynomial and algebraic computation Open access 0 citations Merging Adjacent Cells During Single Cell Construction 2024 Lecture notes in computer science conference-paper Biochemistry, Genetics and Molecular Biology Proteoglycans and glycosaminoglycans research 2 citations Subtropical Satisfiability for SMT Solving 2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification 1 citations On the Implementation of Cylindrical Algebraic Coverings for Satisfiability Modulo Theories Solving 2021 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) conference-paper Computer Science Formal Methods in Verification Open access 3 citations Implementing arithmetic over algebraic numbers A tutorial for Lazard's lifting scheme in CAD 2021 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) conference-paper Computer Science Polynomial and algebraic computation 1 citations Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic 2021 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access 0 citations Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings 2020 Journal of Logical and Algebraic Methods in Programming article Computer Science Constraint Satisfaction and Optimization Open access 34 citations New Opportunities for the Formal Proof of Computational Real Geometry? 2020 arXiv (Cornell University) preprint Engineering Advanced Numerical Analysis Techniques Open access 6 citations New Opportunities for the Formal Proof of Computational Real Geometry? (Extended Abstract) 2020 CEUR Workshop Proceedings article Computer Science Computational Geometry and Mesh Generation Open access 0 citations 9 results References 0