Conference contribution


Symbolic system synthesis using answer set programming


Publication Details
Author(s): Andres B, Gebser M, Schaub T, Haubelt C, Reimann F, Glaß M
Publication year: 2013
Conference Proceedings Title: Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)
Pages range: 79-91
ISBN: 9783642405631

Event details
Event: 12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013
Event location: Corunna
Start date of the event: 15/09/2013
End date of the event: 19/09/2013

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.



How to cite
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).

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: Download
Share link
Last updated on 2017-02-24 at 01:39
PDF downloaded successfully