Symbolic system synthesis using answer set programming

Andres B, Gebser M, Schaub T, Haubelt C, Reimann F, Glaß M (2013)

Publication Status: Published

Publication Type: Conference contribution

Publication year: 2013

Pages Range: 79-91

Conference Proceedings Title: Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)

Event location: Corunna ES

ISBN: 9783642405631

DOI: 10.1007/978-3-642-40564-8_9

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.

Authors with CRIS profile

Felix Reimann Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design) Michael Glaß Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)

Involved external institutions

Universität Potsdam DE Germany (DE) Universität Rostock DE Germany (DE)

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). 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: Download