The Seventh Answer Set Programming Competition: Design and Results

DOI10.1017/S1471068419000061zbMATH Open1472.68026arXiv1904.09134MaRDI QIDQ4957192

Marco Maratea, Martin Gebser, F. Ricca

Publication date: 3 September 2021

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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 University of Potsdam (Germany), in affiliation with the 14th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR 2017). (Under consideration for acceptance in TPLP).

Full work available at URL: https://arxiv.org/abs/1904.09134

zbMATH Keywords

answer set programmingcompetition

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in WASP
• The ASP system DLV2
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Semi-equilibrium models for paracoherent answer set programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• The DLV system for knowledge representation and reasoning
• AI*IA 2013: Advances in artificial intelligence. XIIIth international conference of the Italian Association for Artificial Intelligence, Turin, Italy, December 4--6, 2013. Proceedings
• Integrating answer set programming and constraint logic programming
• Answer set programming and plan generation
• Logic programs with stable model semantics as a constraint programming paradigm
• Engineering an Incremental ASP Solver
• Dynamic Consistency Checking in Goal-Directed Answer Set Programming
• Learning discrete decomposable graphical models via constraint optimization
• Twelve Definitions of a Stable Model
• Logic programming and knowledge representation---The A-Prolog perspective
• The design of the Seventh Answer Set Programming Competition
• Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
• Answer Set Programming: A Primer
• The Sixth Answer Set Programming Competition
• Design and results of the Fifth Answer Set Programming Competition
• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
• A fixpoint characterization of abductive logic programs
• CASP solutions for planning in hybrid domains
• Progress in clasp Series 3
• Stable-unstable semantics: Beyond NP with normal logic programs
• Improving the Normalization of Weight Rules in Answer Set Programs
• New models for generating hard random Boolean formulas and disjunctive logic programs
• Multi-level Algorithm Selection for ASP
• Optimizing phylogenetic supertrees using answer set programming
• Answer Set Programming Modulo Acyclicity*
• ASPeRiX, a first-order forward chaining approach for answer set computing
• Rewriting optimization statements in answer-set programs

Cited In (15)

• The Design of the Sixth Answer Set Programming Competition
• Paracoherent answer set computation
• Parallel Logic Programming: A Sequel
• Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints
• Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming
• FOLASP: FO(·) as Input Language for Answer Set Solvers
• Title not available (Why is that?)
• Design and results of the Fifth Answer Set Programming Competition
• Title not available (Why is that?)
• A machine learning system to improve the performance of ASP solving based on encoding selection
• Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
• Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy
• The design of the Seventh Answer Set Programming Competition
• Deontic equilibrium logic with explicit negation
• Graph-based construction of minimal models

Uses Software

• clasp
• WASP
• IDP3
• DLV2

Recommendations

• The design of the Seventh Answer Set Programming Competition 👍 👎
• The Design of the Sixth Answer Set Programming Competition 👍 👎
• Answer Set Programming: A Declarative Approach to Solving Search Problems 👍 👎
• The Sixth Answer Set Programming Competition 👍 👎
• Design and results of the Fifth Answer Set Programming Competition 👍 👎
• Seventh ASPOCP International Workshop on ‘Answer Set Programming and Other Computing Paradigms’ 👍 👎

This page was built for publication: The Seventh Answer Set Programming Competition: Design and Results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957192)