Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Symbolic Computation | Quantifier elimination,Automated reasoning,Real arithmetic,Nonlinear system,Computer science,Prenex normal form,Satisfiability,Symbolic computation,Arithmetic,Mathematical software |
DocType | Volume | ISSN |
Journal | abs/1806.11447 | In: A. Bigatti and M. Brain eds. Proceedings of the 3rd Workshop
on Satisfiability Checking and Symbolic Computation (SC2 '18), pp. 48-60.
CEUR Workshop Proceedings 2189, 2018 |
Citations | PageRank | References |
1 | 0.39 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Casey B. Mulligan | 1 | 2 | 1.08 |
| Russell J. Bradford | 2 | 255 | 25.29 |
| James H. Davenport | 3 | 844 | 141.40 |
| Matthew England | 4 | 192 | 20.58 |
| Zak Tonks | 5 | 1 | 0.73 |