Improving the Normalization of Weight Rules in Answer Set Programs

Bomanson, Jori; Gebser, Martin; Janhunen, Tomi

doi:10.1007/978-3-319-11558-0_12

Cited by 32 publications

(38 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…11 However, this approach does not support ASP programs with aggregates (e.g., #count), which leads to more complex and somewhat less intuitive programs. To work around this issue, one could use the lp2normal tool [9], which transforms ASP programs with aggregates into equivalent ASP programs without aggregates.…”

Section: Related Encoding Approachesmentioning

confidence: 99%

Very Hard Electoral Control Problems

Fitzsimmons

Hemaspaandra

Hoover

et al. 2019

AAAI

View full text Add to dashboard Cite

It is important to understand how the outcome of an election can be modified by an agent with control over the structure of the election. Electoral control has been studied for many election systems, but for all studied systems the winner problem is in P, and so control is in NP. There are election systems, such as Kemeny, that have many desirable properties, but whose winner problems are not in NP. Thus for such systems control is not in NP, and in fact we show that it is typically complete for Σ p 2 (i.e., NP NP , the second level of the polynomial hierarchy). This is a very high level of complexity. Approaches that perform quite well for solving NP problems do not necessarily work for Σ p 2 -complete problems. However, answer set programming is suited to express problems in Σ p 2 , and we present an encoding for Kemeny control.

show abstract

Section: Related Encoding Approachesmentioning

confidence: 99%

Very Hard Electoral Control Problems

Fitzsimmons

Hemaspaandra

Hoover

et al. 2019

AAAI

View full text Add to dashboard Cite

show abstract

“…The first system, LP2NORMAL+CLASP, represents a native approach based on CLASP, where the preprocessor LP2NORMAL (Bomanson, Gebser, & Janhunen, 2014) is run beforehand to "normalize" aggregates of small to medium size, i.e., aggregates like #count and #sum are replaced by basic subprograms without such constructs when the resulting size increase is acceptable according to heuristics.…”

Section: Aalto Teammentioning

confidence: 99%

The Sixth Answer Set Programming Competition

Gebser¹,

Maratea²,

Ricca³

2017

jair

Self Cite

View full text Add to dashboard Cite

Answer Set Programming (ASP) is a well-known paradigm of declarative programming with roots in logic programming and non-monotonic reasoning. Similar to other closely related problemsolving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advancements in ASP solving are assessed in competition events. In this paper, we report about the design and results of the Sixth ASP Competition, which was jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genoa (Italy), in affiliation with the 13th International Conference on Logic Programming and Non-Monotonic Reasoning. This edition maintained some of the design decisions introduced in 2014, e.g., the conception of sub-tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the topperforming systems are given more time for solving hard benchmarks.

show abstract

“…Rules 5and (6) encode such an intuition. Moreover, rule (7) guarantees that at least one between p i and p F i belongs to any model of reducts obtained from interpretations containing aux . It is interesting to observe that when aux belongs to I the satisfaction of the associated aggregate can be tested according to all subsets of I in the reduct F (Π, I).…”

Section: Non-convex Aggregates Eliminationmentioning

confidence: 99%

“…A different rewriting was presented by [17], whose output are programs with nested expressions, a construct that is not supported by current ASP systems. Other relevant rewriting techniques were proposed in [8,7], and proved to be quite efficient in practice. However, these rewritings produce aggregate-free programs preserving F-stable models only in the stratified case, or if recursion is limited to convex aggregates.…”

Section: Related Workmentioning

confidence: 99%

“…However, these rewritings produce aggregate-free programs preserving F-stable models only in the stratified case, or if recursion is limited to convex aggregates. On the other hand, it is interesting to observe that the rewritings of [8,7] are applicable to the output of the rewritings presented in this paper in order to completely eliminate aggregates, thus preserving F-stable models in general. Several other stable model semantics were proposed for interpreting logic programs with aggregates.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Evaluating Answer Set Programming with Non-Convex Recursive Aggregates

Alviano

2016

View full text Add to dashboard Cite

Aggregation functions are widely used in answer set programming (ASP) for representing and reasoning on knowledge involving sets of objects collectively. These sets may also depend recursively on the results of the aggregation functions, even if so far the support for such recursive aggregations was quite limited in ASP systems. In fact, recursion over aggregates was restricted to convex aggregates, i.e., aggregates that may have only one transition from false to true, and one from true to false, in this specific order. Recently, such a restriction has been overcome, so that the user can finally use non-convex recursive aggregates in ASP programs, either on purpose or accidentally. A preliminary evaluation of ASP programs with non-convex recursive aggregates is reported in this paper.

show abstract

Improving the Normalization of Weight Rules in Answer Set Programs

Cited by 32 publications

References 33 publications

Very Hard Electoral Control Problems

Very Hard Electoral Control Problems

The Sixth Answer Set Programming Competition

Evaluating Answer Set Programming with Non-Convex Recursive Aggregates

Contact Info

Product

Resources

About