The Seventh Answer Set Programming Competition: Design and Results

  title={The Seventh Answer Set Programming Competition: Design and Results},
  author={M. Gebser and Marco Maratea and F. Ricca},
  journal={Theory and Practice of Logic Programming},
  pages={176 - 204}
Abstract Answer Set Programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning. Biennial ASP competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving. In this paper, we report on the design and results of the Seventh ASP Competition, jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the… 

Compilation of Aggregates in ASP: Preliminary Results

An extension of ASP program compilation that supports constraints containing the aggregate count is presented, and preliminary experimental results demonstrate the viability of the approach.

FOLASP: FO(.) as Input Language for Answer Ser Solvers

Experimental results are presented to show that the resulting combination of the translation with an off-the-shelf ASP solver is competitive with the IDP system as a way of solving problems formulated in FO(·).

LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories

Results are mixed: overall, traditional ASP solvers still outperform the translational approach, but several benchmark families are identified where the balance shifts the other way, thereby suggesting that further investigation into a stronger proof system for ASP is valuable.

On the Configuration of More and Less Expressive Logic Programs

This paper considers two well-known model-based AI methodologies, SAT and ASP, define a number of syntactic features that may characterise their inputs, and use automated configuration tools to reformulate the input formula or program.

Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints

A new approach that generalises learned nogoods for re-use to speed-up the solving of future problem instances is suggested, which combines well-known ASP solving techniques with deductive logic-based machine learning.

Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programming

This work provides an implementation in Alpha that makes Alpha the first lazy-grounding ASP system to support declaratively specified domain-specific heuristics, and uses it to implement informed search with A*, which is tackled within ASP for the first time.

Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP

The implementation in the lazy-grounding ASP system Alpha supports heuristic directives under a novel semantics for declarative specifications of domain-specific heuristics in Answer Set Programming (ASP), providing the first implementation for incorporating declaratively specified domain- specific heURistics in a lazy-Grounding setting.

Solving Configuration Problems with ASP and Declarative Domain Specific Heuristics

A novel syntax and semantics for declarative specifications of domain-specific heuristics in ASP that supports heuristic statements that depend on the partial assignment maintained during solving, which has not been possible before.

Modeling Clique Coloring via ASP(Q)

This paper provides two modeling into ASP, one using the basic version of ASP and the so-called saturation technique, and another one using a new extension of ASP with quantifiers, named ASP(Q), that is a much more powerful language able to model each computational problem in the polynomial hierarchy.



The Design of the Seventh Answer Set Programming Competition

A novel feature of this competition edition is the re-introduction of a Model&Solve track, complementing the usual System track with problem domains where participants need to provide dedicated encodings and solving means.

The Design of the Sixth Answer Set Programming Competition - - Report -

This edition of the Sixth ASP Competition maintains some of the design decisions introduced in the last event, but features also some novelties, like a benchmarks selection stage to classify instances according to their expected hardness, and a “marathon” track where the best performing systems are given more time for solving hard benchmarks.

The Sixth Answer Set Programming Competition

This edition of the Sixth ASP Competition maintained some of the design decisions introduced in 2014, but 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.

Design and results of the Fifth Answer Set Programming Competition

What's Hot in the Answer Set Programming Competition

The ASP competition series aims at assessing and promoting the evolution of ASP systems and applications, and its growing range of challenging application-oriented benchmarks inspires and showcases continuous advancements of the state of the art in ASP.

The third open answer set programming competition

The format of the competition and the rationale behind it are discussed, the results for both tracks are reported, and comparison with the second ASP competition and state-of-the-art solutions for some of the benchmark domains are discussed.

A multi-engine approach to answer-set programming*

A set of cheap-to-compute syntactic features that characterize several aspects of ASP programs are defined and it is shown that by applying machine learning techniques to ASP solving, it is possible to obtain very robust performance.

Answer Set Programming: A Primer

This article starts with motivation and follows the historical development of the challenge of defining a semantics for logic programs with negation, and proceeds to extensions with two kinds of negation (named weak and strong negation), and disjunction in rule heads.

Answer Set Programming as SAT modulo Acyclicity

A linear embedding of logic programs is devised and the performance of answer set computation with SAT modulo acyclicity solvers is studied.

On the Computation of Paracoherent Answer Sets

Several different algorithms to compute semi-stable and semi-equilibrium models are proposed and implemented into an answer set solving framework and an empirical performance comparison among the new algorithms on benchmarks from ASP competitions is given.