3 citations · 3 across the 3 of their papers we have counts for
5 papers · 1 filter
Strong Equivalence in Answer Set Programming with Constraints
Pedro Cabalar, Jorge Fandinno, Torsten Schaub +1
We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints. Two groups of rules are considered strongly equivalent if…
Towards a Semantics for Hybrid ASP systems
Pedro Cabalar, Jorge Fandinno, Torsten Schaub +1
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficu…
An ASP semantics for Constraints involving Conditional Aggregates
Pedro Cabalar, Jorge Fandinno, Torsten Schaub +1
We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) and extend its underlying logical framework with aggregate functions over constraint values and vari…
Design Space Exploration via Answer Set Programming Modulo Theories
Philipp Wanko
The design of embedded systems, that are ubiquitously used in mobile devices and cars, is becoming continuously more complex such that efficient system-level design methods are bec…
Clingo goes Linear Constraints over Reals and Integers
Tomi Janhunen, Roland Kaminski, Max Ostrowski +3
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…