Clingo goes Linear Constraints over Reals and Integers

by   Tomi Janhunen, et al.

The recent series 5 of the ASP system clingo provides generic means to enhance basic Answer Set Programming (ASP) with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints, discuss the respective implementations, and present techniques of how to use 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 fragments and contrast them to related ASP systems. This paper is under consideration for acceptance in TPLP.



page 1

page 2

page 3

page 4


Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming

We propose a novel formal framework (called 3D-nCDC-ASP) to represent an...

ASP(AC): Answer Set Programming with Algebraic Constraints

Weighted Logic is a powerful tool for the specification of calculations ...

Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis

Answer Set Programming (ASP) is a well-established declarative paradigm....

ROSoClingo: A ROS package for ASP-based robot control

Knowledge representation and reasoning capacities are vital to cognitive...

An ASP semantics for Constraints involving Conditional Aggregates

We elaborate upon the formal foundations of hybrid Answer Set Programmin...

Towards a Semantics for Hybrid ASP systems

Over the last decades the development of ASP has brought about an expres...

plingo: A system for probabilistic reasoning in clingo based on lpmln

We present plingo, an extension of the ASP system clingo with various pr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.