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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bomanson J, Janhunen T (2013) Normalizing cardinality rules using merging and sorting constructions. Proc LPNMR 2013:187–199
Brewka G, Eiter T, Truszczyński M (2011) Answer set programming at a glance. ACM Comm 54(12):92–103
Gebser M, Janhunen T, Rintanen J (2014) Answer set programming as SAT modulo acyclicity. Proc ECAI 2014:351–356
Janhunen T (2004) Representing normal programs with clauses. Proc ECAI 2004:358–362
Janhunen T, Niemelä I (2011) Compact translations of non-disjunctive answer set programs to propositional clauses. Gelfond Festscrift, LNCS 6565:111–130
Janhunen T, Niemelä I, Sevalnev M (2009) Computing stable models via reductions to difference logic. Proc LPNMR 2009:142–154
Liu G, Janhunen T, Niemelä I (2012) Answer set programming via mixed integer programming. Proc KR 2012:32–42
Merrill J (2003) GENERIC and GIMPLE: a new tree representation for functions. Proceedings of the GCC Developers Summit. Red Hat Inc, Ottawa, Ontario, Canada, pp 171–180. https://gcc.gnu.org/wiki/HomePage?action=AttachFile%26do=get%26target=2003-GCC-Summit-Proceedings.pdf
Nguyen M, Janhunen T, Niemelä I (2013) Translating answer-set programs into bit-vector logic. Proc INAP 2012:95–113
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by the Academy of Finland (under grant #251170).
Rights and permissions
About this article
Cite this article
Janhunen, T. Cross-Translating Answer Set Programs Using the ASPTOOLS Collection. Künstl Intell 32, 183–184 (2018). https://doi.org/10.1007/s13218-018-0529-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13218-018-0529-9