@misc{NeubauerWankoSchaubetal.2017,
  author    = {Neubauer, Kai and Wanko, Philipp and Schaub, Torsten H. and Haubelt, Christian},
  title     = {Enhancing symbolic system synthesis through ASPmT with partial assignment evaluation},
  series = {Proceedings of the Design, Automation \& Test in Europe Conference \& Exhibition (DATE), 2017},
  journal   = {Proceedings of the Design, Automation \& Test in Europe Conference \& Exhibition (DATE), 2017},
  publisher = {IEEE},
  address   = {New York},
  isbn      = {978-3-9815370-9-3},
  issn      = {1530-1591},
  doi       = {10.23919/DATE.2017.7927005},
  pages     = {306 -- 309},
  year      = {2017},
  abstract  = {The design of embedded systems is becoming continuously more complex such that efficient system-level design methods are becoming crucial. Recently, combined Answer Set Programming (ASP) and Quantifier Free Integer Difference Logic (QF-IDL) solving has been shown to be a promising approach in system synthesis. However, this approach still has several restrictions limiting its applicability. In the paper at hand, we propose a novel ASP modulo Theories (ASPmT) system synthesis approach, which (i) supports more sophisticated system models, (ii) tightly integrates the QF-IDL solving into the ASP solving, and (iii) makes use of partial assignment checking. As a result, more realistic systems are considered and an early exclusion of infeasible solutions improves the entire system synthesis.},
  language  = {en}
}