Clingo goes linear constraints over reals and integers

Research output: Contribution to journalArticleScientificpeer-review

Researchers

  • Tomi Janhunen

  • Roland Kaminski
  • Max Ostrowski
  • Sebastian Schellhorn
  • Philipp Wanko
  • Torsten Schaub

Research units

  • University of Potsdam
  • INRIA Rennes

Abstract

The recent series 5 of the Answer Set Programming (ASP) system clingo provides generic means to enhance basic ASP with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints and elaborate upon its formal properties. Given this, we discuss the respective implementations, and present techniques for using these constraints in a reactive context. More precisely, we introduce extensions to clingo with difference and linear constraints over integers and reals, respectively, and realize them in complementary ways. Finally, we empirically evaluate the resulting clingo derivatives clingo[dl] and clingo[lp] on common language fragments and contrast them to related ASP systems.

Details

Original languageEnglish
Pages (from-to)872-888
JournalTheory and Practice of Logic Programming
Volume17
Issue number5-6
Publication statusPublished - 2017
MoE publication typeA1 Journal article-refereed
EventInternational Conference on Logic Programming - Melbourne, Australia
Duration: 28 Aug 20171 Sep 2017
Conference number: 33

    Research areas

  • answer set programming, constraints, constraint processing, theory solving

ID: 16215718