Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic

Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long and successful history in the development of tools for proving termination of programs. Well-known and very efficient techniques, like SAT algorithms and tools, have been recently proposed and used for implementing polynomial constraint solving algorithms through appropriate encodings. However, powerful techniques like the ones provided by the SMT (SAT modulo theories) approach for linear arithmetic constraints (over the rationals) are underexplored to date. In this paper we show that the use of these techniques for developing polynomial constraint solvers outperforms the best existing solvers and provides a new and powerful approach for implementing better and more general solvers for termination provers.

• Type: Conference
• Year: 2009
• Where: CADE
• Authors: Albert Rubio, Cristina Borralleras, Enric Rodríguez-Carbonell, Rafael Navarro-Marset, Salvador Lucas
• Keywords: Automated Reasoning, CADE 2009, Constraint Solving Algorithms, Polynomial Constraint Solvers, Polynomial Constraint-solving Plays