The Seventh Answer Set Programming Competition: Design and Results
From MaRDI portal
Publication:4957192
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).
Recommendations
- The design of the Seventh Answer Set Programming Competition
- Design and results of the Fifth Answer Set Programming Competition
- The Design of the Sixth Answer Set Programming Competition
- The Sixth Answer Set Programming Competition
- Preface: Seventh ASPOCP international workshop on `Answer set programming and other computing paradigms'
- Answer Set Programming: A Declarative Approach to Solving Search Problems
Cites work
- A fixpoint characterization of abductive logic programs
- Advances in WASP
- AI*IA 2013: Advances in artificial intelligence. XIIIth international conference of the Italian Association for Artificial Intelligence, Turin, Italy, December 4--6, 2013. Proceedings
- Answer set programming and plan generation
- Answer set programming modulo acyclicity
- Answer Set Programming: A Primer
- CASP solutions for planning in hybrid domains
- Compact translations of non-disjunctive answer set programs to propositional clauses
- Design and results of the Fifth Answer Set Programming Competition
- Dynamic consistency checking in goal-directed answer set programming
- Engineering an Incremental ASP Solver
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 6747915 (Why is no real title available?)
- Improving the normalization of weight rules in answer set programs
- Integrating answer set programming and constraint logic programming
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Learning discrete decomposable graphical models via constraint optimization
- Logic programming and knowledge representation---The A-Prolog perspective
- Logic programs with stable model semantics as a constraint programming paradigm
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Multi-level Algorithm Selection for ASP
- New models for generating hard random Boolean formulas and disjunctive logic programs
- On the computational cost of disjunctive logic programming: Propositional case
- Optimizing phylogenetic supertrees using answer set programming
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- Progress in clasp series 3
- Propositional semantics for disjunctive logic programs
- Rewriting optimization statements in answer-set programs
- Semi-equilibrium models for paracoherent answer set programs
- Stable-unstable semantics: Beyond NP with normal logic programs
- The ASP system DLV2
- The design of the Seventh Answer Set Programming Competition
- The DLV system for knowledge representation and reasoning
- The Sixth Answer Set Programming Competition
- The traveling salesman problem. A computational study.
- Twelve Definitions of a Stable Model
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
Cited in
(23)- Graph-based construction of minimal models
- Paracoherent answer set computation
- The design of the Seventh Answer Set Programming Competition
- Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy
- Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination
- A machine learning system to improve the performance of ASP solving based on encoding selection
- The Design of the Sixth Answer Set Programming Competition
- Answer set programming
- ASP-Core-2 input language format
- Manipulation of articulated objects using dual-arm robots via answer set programming
- scientific article; zbMATH DE number 7453100 (Why is no real title available?)
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- Conflict generalisation in ASP: learning correct and effective non-ground constraints
- The Sixth Answer Set Programming Competition
- Using Answer Set Programming for the Automatic Compilation of Assessment Tests
- FOLASP: FO(·) as Input Language for Answer Set Solvers
- Parallel Logic Programming: A Sequel
- Deontic equilibrium logic with explicit negation
- ETH lower bounds for n-queens: time waits for nobody
- Scheduling pre-operative assessment clinic with answer set programming
- A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments
- On the configuration of more and less expressive logic programs
- Design and results of the Fifth Answer Set Programming Competition
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)
