Proofs of Unsatisfiability for mixed Boolean and Non-linear Arithmetic Constraint Formulae - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Stefan Kupferschmid, Tino Teige, Bernd Becker, Martin Fränzle. Proofs of Unsatisfiability for mixed Boolean and Non-linear Arithmetic Constraint Formulae. In Carsten Gremzow, Nico Moser, editors, Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), Berlin, Germany, March 2-4, 2009. pages 27-36, Universitätsbibliothek Berlin, Germany, 2009.

This author has not been identified. Look up 'Stefan Kupferschmid' in GoogleThis author has not been identified. Look up 'Tino Teige' in GoogleThis author has not been identified. Look up 'Bernd Becker' in GoogleThis author has not been identified. Look up 'Martin Fränzle' in Google

runs on WebDSL