• search hit 1 of 2
Back to Result List

Clingo goes linear constraints over reals and integers

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

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Tomi Janhunen, Roland KaminskiORCiD, Max OstrowskiGND, Sebastian SchellhornORCiD, Philipp WankoORCiD, Torsten H. SchaubORCiDGND
DOI:https://doi.org/10.1017/S1471068417000242
ISSN:1471-0684
ISSN:1475-3081
Title of parent work (English):Theory and practice of logic programming
Publisher:Cambridge Univ. Press
Place of publishing:New York
Publication type:Article
Language:English
Year of first publication:2017
Publication year:2017
Release date:2020/04/20
Tag:Answer Set Programming (ASP); Constraint Answer Set Programming (CASP); Constraint Processing (CP); Theory Solving
Volume:17
Number of pages:17
First page:872
Last Page:888
Funding institution:DFG [550/9, 11]; Academy of Finland [251170]
Peer review:Referiert
Institution name at the time of the publication:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.