Smodels with CLP - A Treatment of Aggregates in ASP

this paper. We employ a different execution model---which has the potential of covering a slightly larger set of program than those dealt with in [5]. The specific approach proposed in this work is aimed at accomplishing the same objectives as similar proposals recently appeared in the literature [5, 11]. The novelty of our approach lies in the technique adopted to support aggregates. Following the spirit of our previous efforts [8, 4, 7], we rely on the integration of different constraint solving technologies to support the management of different flavors of sets and aggregations. In particular, in this work we describe a backend inference engine, obtained by the integration of smodels with a finite-domain constraint solver, capable of executing smodels program with aggregates. The backend is meant to be used in conjunction with front-ends capable of performing high-level constraint handling of sets and aggregates (as described in [8]

Smodels with CLP—A Treatment of Aggregates in ASP

In recent years we have witnessed a renovated interest towards the development of practical, effective, and efficient implementations of different flavors of logic programming. A significant deal of research has been invested in the development of systems that support logic programming under answer set semantics, favoring the creation of a novel programming paradigm, commonly referred to as Answer Set Programming (ASP) (e.g. [13])