Non-linear real arithmetic benchmarks derived from automated reasoning in economics

Casey B. Mulligan, Russell Bradford, James H. Davenport, Matthew England, Zak Tonks

Research output: Contribution to journalConference articlepeer-review

9 Citations (SciVal)


We consider problems originating in economics that may be solved automatically using mathematical software. We present and make freely available a new benchmark set of such problems. The problems have been shown to fall within the framework of non-linear real arithmetic, and so are in theory soluble via Quantifier Elimination (QE) technology as usually implemented in computer algebra systems. Further, they all can be phrased in prenex normal form with only existential quantifiers and so are also admissible to those Satisfiability Module Theory (SMT) solvers that support the QF_NRA logic. There is a great body of work considering QE and SMT application in science and engineering, but we demonstrate here that there is potential for this technology also in the social sciences.

Original languageEnglish
Article number2
Pages (from-to)48-60
Number of pages13
JournalCEUR Workshop Proceedings
Publication statusPublished - 11 Jul 2018
Event3rd Workshop on Satisfiability Checking and Symbolic Computation, SC-Square 2018 - Oxford, UK United Kingdom
Duration: 11 Jul 2018 → …

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Non-linear real arithmetic benchmarks derived from automated reasoning in economics'. Together they form a unique fingerprint.

Cite this