Symbolic system synthesis using answer set programming

Beitrag bei einer Tagung


Details zur Publikation

Autor(en): Andres B, Gebser M, Schaub T, Haubelt C, Reimann F, Glaß M
Jahr der Veröffentlichung: 2013
Tagungsband: Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)
Seitenbereich: 79-91
ISBN: 9783642405631


Abstract


Recently, Boolean Satisfiability (SAT) solving has been proposed to tackle the increasing complexity in high-level system design. Working well for system specifications with a limited amount of routing options, they tend to fail for densely connected computing platforms. This paper proposes an automated system design approach employing Answer Set Programming (ASP). ASP provides a stringent semantics, allowing for an efficient representation of routing options. An automotive case-study illustrates that the proposed ASP-based system design approach is competitive for sparsely connected computing platforms, while it outperforms SAT-based approaches for dense Networks-on-Chip by an order of magnitude. © 2013 Springer-Verlag.



FAU-Autoren / FAU-Herausgeber

Glaß, Michael Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)
Reimann, Felix
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)


Autor(en) der externen Einrichtung(en)
Universität Potsdam
Universität Rostock


Zitierweisen

APA:
Andres, B., Gebser, M., Schaub, T., Haubelt, C., Reimann, F., & Glaß, M. (2013). Symbolic system synthesis using answer set programming. In Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) (pp. 79-91). Corunna, ES.

MLA:
Andres, Benjamin, et al. "Symbolic system synthesis using answer set programming." Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013, Corunna 2013. 79-91.

BibTeX: 

Zuletzt aktualisiert 2018-17-10 um 21:50