Skip to main content
Log in

Cross-Translating Answer Set Programs Using the ASPTOOLS Collection

  • Systems Description
  • Published:
KI - Künstliche Intelligenz Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. http://research.ics.aalto.fi/software/asp/.

  2. http://en.wikibooks.org/wiki/GNU_C_Compiler_Internals.

References

  1. Bomanson J, Janhunen T (2013) Normalizing cardinality rules using merging and sorting constructions. Proc LPNMR 2013:187–199

    MathSciNet  MATH  Google Scholar 

  2. Brewka G, Eiter T, Truszczyński M (2011) Answer set programming at a glance. ACM Comm 54(12):92–103

    Article  Google Scholar 

  3. Gebser M, Janhunen T, Rintanen J (2014) Answer set programming as SAT modulo acyclicity. Proc ECAI 2014:351–356

    MATH  Google Scholar 

  4. Janhunen T (2004) Representing normal programs with clauses. Proc ECAI 2004:358–362

    Google Scholar 

  5. Janhunen T, Niemelä I (2011) Compact translations of non-disjunctive answer set programs to propositional clauses. Gelfond Festscrift, LNCS 6565:111–130

  6. Janhunen T, Niemelä I, Sevalnev M (2009) Computing stable models via reductions to difference logic. Proc LPNMR 2009:142–154

    MathSciNet  MATH  Google Scholar 

  7. Liu G, Janhunen T, Niemelä I (2012) Answer set programming via mixed integer programming. Proc KR 2012:32–42

    Google Scholar 

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

    Google Scholar 

  9. Nguyen M, Janhunen T, Niemelä I (2013) Translating answer-set programs into bit-vector logic. Proc INAP 2012:95–113

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tomi Janhunen.

Additional information

Research supported by the Academy of Finland (under grant #251170).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13218-018-0529-9

Keywords

Navigation