Design and results of the Fifth Answer Set Programming Competition

DOI10.1016/J.ARTINT.2015.09.008zbMATH Open1344.68042OpenAlexW2265638991MaRDI QIDQ899444FDOQ899444

Authors: Francesco Calimeri, Martin Gebser, Marco Maratea, F. Ricca 

Publication date: 28 December 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2015.09.008

Recommendations

• The Seventh Answer Set Programming Competition: Design and Results
• The Design of the Sixth Answer Set Programming Competition
• The design of the Seventh Answer Set Programming Competition
• Achievements in answer set programming
• Answer Set Programming: A Declarative Approach to Solving Search Problems
• The Sixth Answer Set Programming Competition

zbMATH Keywords

answer set programmingcomputational logicsolver competition

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17)

Cites Work

• Theory and Applications of Satisfiability Testing
• GASP: Answer set programming with lazy grounding
• ASSAT: computing answer sets of a logic program by SAT solvers
• Extending and implementing the stable model semantics
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Title not available (Why is that?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• The DLV system for knowledge representation and reasoning
• Semantics and complexity of recursive aggregates in answer set programming
• Optimization Methods for the Partner Units Problem
• Evaluating ASP and commercial solvers on the CSPLib
• Answer set programming and plan generation
• Conflict-driven answer set solving: from theory to practice
• Logic programs with stable model semantics as a constraint programming paradigm
• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
• Title not available (Why is that?)
• GRASP: a search algorithm for propositional satisfiability
• Title not available (Why is that?)
• Multi-threaded ASP solving with clasp
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Answer set programming based on propositional satisfiability
• Design and implementation of aggregate functions in the DLV system
• Unfolding partiality and disjunctions in stable model semantics
• Logics in Artificial Intelligence
• Team-building with answer set programming in the Gioia-Tauro seaport
• Title not available (Why is that?)
• Tight logic programs
• Declarative problem-solving using the DLV system
• Logic programming and knowledge representation---The A-Prolog perspective
• Normalizing Cardinality Rules Using Merging and Sorting Constructions
• The intelligent grounder of DLV
• Compact translations of non-disjunctive answer set programs to propositional clauses
• Answer Set Programming: A Primer
• Title not available (Why is that?)

Cited In (37)

• Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
• ASP Solving for Expanding Universes
• Lpopt: a rule optimization tool for answer set programming
• Design and results of the second international competition on computational models of argumentation
• The Design of the Sixth Answer Set Programming Competition
• Rewriting optimization statements in answer-set programs
• Logic Programming and Nonmonotonic Reasoning
• Stable-unstable semantics: Beyond NP with normal logic programs
• ASP-Core-2 Input Language Format
• Efficiently Coupling the I-DLV Grounder with ASP Solvers
• Optimizing Answer Set Computation via Heuristic-Based Decomposition
• plasp 3: Towards Effective ASP Planning
• Title not available (Why is that?)
• Debugging Non-ground ASP Programs: Technique and Graphical Tools
• Multi-level Algorithm Selection for ASP
• Paracoherent answer set computation
• Abstract Solvers for Computing Cautious Consequences of ASP programs
• The Seventh Answer Set Programming Competition: Design and Results
• Logic programming
• Solution Enumeration by Optimality in Answer Set Programming
• Coalition formation in social environments with logic-based agents1
• FOLASP: FO(·) as Input Language for Answer Set Solvers
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Title not available (Why is that?)
• Estimating grounding sizes of logic programs under answer set semantics
• Testing in ASP: revisited language and programming environment
• Preface
• New models for generating hard random Boolean formulas and disjunctive logic programs
• On the complexity of the partner units decision problem
• Better Paracoherent Answer Sets with Less Resources
• Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
• Adaptive large-neighbourhood search for optimisation in answer-set programming
• The design of the Seventh Answer Set Programming Competition
• Shared aggregate sets in answer set programming
• Query answering in resource-based answer set semantics
• Graph-based construction of minimal models

Uses Software

• MiniSat
• ASSAT
• SMT-LIB
• MiniZinc
• PDDL
• clasp
• GASP
• WASP
• QBFLIB
• Clingo
• Datalog
• pyrunlim

This page was built for publication: Design and results of the Fifth Answer Set Programming Competition

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