| id |
ndltd-NEU--neu-rx915d92r
|
| record_format |
oai_dc
|
| spelling |
ndltd-NEU--neu-rx915d92r2021-05-28T05:22:14ZMathematical programming modulo theoriesWe present the Mathematical Programming Modulo Theories (MPMT) constraint solving framework. MPMT enhances Mathematical Programming by integrating techniques from the field of Automated Reasoning, e.g., solvers for first-order theories. We develop the Branch and Cut Modulo T (BC(T) architecture for MPMT solvers. BC(T) is formalized as a family of transition systems. We outline classes of first-order theories that BC(T) accommodates. We finally discuss the algorithmic aspects of our BC(T) implementation, and explore potential applications.http://hdl.handle.net/2047/D20194113
|
| collection |
NDLTD
|
| sources |
NDLTD
|
| description |
We present the Mathematical Programming Modulo Theories (MPMT) constraint solving framework. MPMT enhances Mathematical Programming by integrating techniques from the field of Automated Reasoning, e.g., solvers for first-order theories. We develop the Branch and Cut Modulo T (BC(T) architecture for MPMT solvers. BC(T) is formalized as a family of transition systems. We outline classes of first-order theories that BC(T) accommodates. We finally discuss the algorithmic aspects
of our BC(T) implementation, and explore potential applications.
|
| title |
Mathematical programming modulo theories
|
| spellingShingle |
Mathematical programming modulo theories
|
| title_short |
Mathematical programming modulo theories
|
| title_full |
Mathematical programming modulo theories
|
| title_fullStr |
Mathematical programming modulo theories
|
| title_full_unstemmed |
Mathematical programming modulo theories
|
| title_sort |
mathematical programming modulo theories
|
| publishDate |
|
| url |
http://hdl.handle.net/2047/D20194113
|
| _version_ |
1719407931362902016
|
