Cross-Translating Answer Set Programs Using the ASPTOOLS Collection

Research output: Contribution to journalArticle

Standard

Cross-Translating Answer Set Programs Using the ASPTOOLS Collection. / Janhunen, Tomi.

In: KUENSTLICHE INTELLIGENZ, Vol. 32, No. 2-3, 14.05.2018, p. 183-184.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

Bibtex - Download

@article{dd56ed450542444697266cfbf8909d7b,
title = "Cross-Translating Answer Set Programs Using the ASPTOOLS Collection",
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.",
keywords = "Cross compilation, Rules, Answer sets, Constraints, Satisfiability",
author = "Tomi Janhunen",
year = "2018",
month = "5",
day = "14",
doi = "10.1007/s13218-018-0529-9",
language = "English",
volume = "32",
pages = "183--184",
journal = "KUENSTLICHE INTELLIGENZ",
issn = "0933-1875",
number = "2-3",

}

RIS - Download

TY - JOUR

T1 - Cross-Translating Answer Set Programs Using the ASPTOOLS Collection

AU - Janhunen, Tomi

PY - 2018/5/14

Y1 - 2018/5/14

N2 - 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.

AB - 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.

KW - Cross compilation

KW - Rules

KW - Answer sets

KW - Constraints

KW - Satisfiability

U2 - 10.1007/s13218-018-0529-9

DO - 10.1007/s13218-018-0529-9

M3 - Article

VL - 32

SP - 183

EP - 184

JO - KUENSTLICHE INTELLIGENZ

JF - KUENSTLICHE INTELLIGENZ

SN - 0933-1875

IS - 2-3

ER -

ID: 29615258