Cross-Translating Answer Set Programs Using the ASPTOOLS Collection

No Thumbnail Available

Access rights

openAccess
acceptedVersion

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)

Authors

Date

2018-05-14

Department

Department of Computer Science

Major/Subject

Mcode

Degree programme

Language

en

Pages

2

Series

Kuenstliche Intelligenz, Volume 32, issue 2-3, pp. 183-184

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.

Description

Keywords

Cross compilation, Rules, Answer sets, Constraints, Satisfiability

Other note

DOI

10.1007/s13218-018-0529-9

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

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-201812106315

Collections

[article-cris] Perustieteiden korkeakoulu / SCI