Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers

DOI10.1145/3340923zbMath1433.68405arXiv2008.13601OpenAlexW2969580900WikidataQ127354500 ScholiaQ127354500MaRDI QIDQ4972164

Daniel Larraz, Albert Rubio, Albert Oliveras, Enric Rodríguez-Carbonell, Cristina Borralleras

Publication date: 22 November 2019

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.13601

zbMATH Keywords

satisfiability modulo theoriesnonlinear arithmetic

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items (2)

Optimization modulo non-linear arithmetic via incremental linearization ⋮ Local Search For Satisfiability Modulo Integer Arithmetic Theories

Uses Software

• SMT-LIB
• Yices
• z3
• ProB
• StarExec
• CVC4
• SMT-RAT
• CalCS
• raSAT
• EFSMT
• vZ
• OptiMathSAT

This page was built for publication: Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers