Design and results of the Fifth Answer Set Programming Competition
From MaRDI portal
Publication:899444
DOI10.1016/j.artint.2015.09.008zbMath1344.68042OpenAlexW2265638991MaRDI QIDQ899444
Marco Maratea, Francesco Ricca, Martin Gebser, Francesco Calimeri
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
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17)
Related Items
ASP Solving for Expanding Universes, Multi-level Algorithm Selection for ASP, The Design of the Sixth Answer Set Programming Competition, Shared aggregate sets in answer set programming, Cautious reasoning in ASP via minimal models and unsatisfiable cores, On the complexity of the partner units decision problem, Lpopt: a rule optimization tool for answer set programming, Solution Enumeration by Optimality in Answer Set Programming, FOLASP: FO(·) as Input Language for Answer Set Solvers, Stable-unstable semantics: Beyond NP with normal logic programs, Query answering in resource-based answer set semantics, Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper), Abstract Solvers for Computing Cautious Consequences of ASP programs, Better Paracoherent Answer Sets with Less Resources, Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring, Unnamed Item, Unnamed Item, Rewriting optimization statements in answer-set programs, Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More, Coalition formation in social environments with logic-based agents1, Paracoherent answer set computation, Debugging Non-ground ASP Programs: Technique and Graphical Tools, New models for generating hard random Boolean formulas and disjunctive logic programs, Design and results of the second international competition on computational models of argumentation, plasp 3: Towards Effective ASP Planning, Optimizing Answer Set Computation via Heuristic-Based Decomposition, The Seventh Answer Set Programming Competition: Design and Results, Efficiently Coupling the I-DLV Grounder with ASP Solvers, ASP-Core-2 Input Language Format, Estimating grounding sizes of logic programs under answer set semantics, Testing in ASP: revisited language and programming environment, Preface, Graph-based construction of minimal models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantics and complexity of recursive aggregates in answer set programming
- ASSAT: computing answer sets of a logic program by SAT solvers
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Answer set programming based on propositional satisfiability
- Evaluating ASP and commercial solvers on the CSPLib
- Logic programming and knowledge representation---The A-Prolog perspective
- Answer set programming and plan generation
- Extending and implementing the stable model semantics
- Conflict-driven answer set solving: from theory to practice
- On the computational cost of disjunctive logic programming: Propositional case
- Propositional semantics for disjunctive logic programs
- Logic programs with stable model semantics as a constraint programming paradigm
- Normalizing Cardinality Rules Using Merging and Sorting Constructions
- The Intelligent Grounder of DLV
- Team-building with answer set programming in the Gioia-Tauro seaport
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- Optimization Methods for the Partner Units Problem
- GASP: Answer Set Programming with Lazy Grounding
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- Design and implementation of aggregate functions in the DLV system
- Answer Set Programming: A Primer
- Knowledge Representation, Reasoning and Declarative Problem Solving
- GRASP: a search algorithm for propositional satisfiability
- Tight logic programs
- Multi-threaded ASP solving with clasp
- Unfolding partiality and disjunctions in stable model semantics
- The DLV system for knowledge representation and reasoning
- Theory and Applications of Satisfiability Testing
- Logics in Artificial Intelligence
