Learning Centre

Cross-Translating Answer Set Programs Using the ASPTOOLS Collection

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.author Janhunen, Tomi
dc.date.accessioned 2018-12-10T10:31:57Z
dc.date.available 2018-12-10T10:31:57Z
dc.date.issued 2018-05-14
dc.identifier.citation Janhunen , T 2018 , ' Cross-Translating Answer Set Programs Using the ASPTOOLS Collection ' , KUENSTLICHE INTELLIGENZ , vol. 32 , no. 2-3 , pp. 183-184 . https://doi.org/10.1007/s13218-018-0529-9 en
dc.identifier.issn 0933-1875
dc.identifier.other PURE UUID: dd56ed45-0542-4446-9726-6cfbf8909d7b
dc.identifier.other PURE ITEMURL: https://research.aalto.fi/en/publications/dd56ed45-0542-4446-9726-6cfbf8909d7b
dc.identifier.other PURE FILEURL: https://research.aalto.fi/files/30223834/SCI_Janhunen_Cross_Translating_Answer_KI_final18b.pdf
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/35300
dc.description.abstract One viable way of implementing answer set programming (ASP) is to compile (ground) logic programs into other formalisms and to use existing solver technology to compute answer sets. In this article, we present an overview of translators used for such compilations, targeting at other solving paradigms such as Boolean satisfiability checking, satisfiability modulo theories, and mixed integer programming. Borrowing ideas from modern compiler design, such translators can be systematically developed in stages so that the details of the target formalism can be incorporated at the last step of the translation. In this way, the resulting translators realize a cross-compilation framework for answer set programs, coined as cross-translation in this article. en
dc.format.extent 2
dc.format.extent 183-184
dc.format.mimetype application/pdf
dc.language.iso en en
dc.relation.ispartofseries KUENSTLICHE INTELLIGENZ en
dc.relation.ispartofseries Volume 32, issue 2-3 en
dc.rights openAccess en
dc.title Cross-Translating Answer Set Programs Using the ASPTOOLS Collection en
dc.type A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä fi
dc.description.version Peer reviewed en
dc.contributor.department Centre of Excellence in Computational Inference, COIN
dc.contributor.department Department of Computer Science en
dc.subject.keyword Cross compilation
dc.subject.keyword Rules
dc.subject.keyword Answer sets
dc.subject.keyword Constraints
dc.subject.keyword Satisfiability
dc.identifier.urn URN:NBN:fi:aalto-201812106315
dc.identifier.doi 10.1007/s13218-018-0529-9
dc.date.embargo info:eu-repo/date/embargoEnd/2019-05-14

Files in this item

Files Size Format View

There are no open access files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search archive

Advanced Search

article-iconSubmit a publication