Cross-Translating Answer Set Programs Using the ASPTOOLS Collection

Research output: Contribution to journalArticleScientificpeer-review

Researchers

Research units

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.

Details

Original languageEnglish
Pages (from-to)183-184
Number of pages2
JournalKUENSTLICHE INTELLIGENZ
Volume32
Issue number2-3
Publication statusPublished - 14 May 2018
MoE publication typeA1 Journal article-refereed

    Research areas

  • Cross compilation, Rules, Answer sets, Constraints, Satisfiability

Download statistics

No data available

ID: 29615258