July 31, 2018 article Open access Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions ACM Transactions on Computational Logic DOI: 10.1145/3230639 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 61 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 Satisfiability Modulo Exponential Integer Arithmetic 2024 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 4 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 Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic 2021 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification 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 Polynomial and algebraic computation Open access 34 citations 4 results References 0