May 01, 2007 article Open access Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure1 Journal on Satisfiability Boolean Modeling and Computation DOI: 10.3233/sat190012 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 314 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 Recent developments in theory and tool support for hybrid systems verification with HyPro 2022 Information and Computation article Computer Science Formal Methods in Verification Open access 6 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 3 results References 0