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

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.

@inproceedings{KupferschmidTBF09,
  title = {Proofs of Unsatisfiability for mixed Boolean and Non-linear Arithmetic Constraint Formulae},
  author = {Stefan Kupferschmid and Tino Teige and Bernd Becker and Martin Fränzle},
  year = {2009},
  researchr = {https://researchr.org/publication/KupferschmidTBF09},
  cites = {0},
  citedby = {0},
  pages = {27-36},
  booktitle = {Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), Berlin, Germany, March 2-4, 2009},
  editor = {Carsten Gremzow and Nico Moser},
  publisher = {Universitätsbibliothek Berlin, Germany},
}