Design and results of the Fifth Answer Set Programming Competition
From MaRDI portal
Publication:899444
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
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 89002 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1884403 (Why is no real title available?)
- scientific article; zbMATH DE number 6747915 (Why is no real title available?)
- ASSAT: computing answer sets of a logic program by SAT solvers
- Answer Set Programming: A Primer
- Answer set programming and plan generation
- Answer set programming based on propositional satisfiability
- Compact translations of non-disjunctive answer set programs to propositional clauses
- Conflict-driven answer set solving: from theory to practice
- Declarative problem-solving using the DLV system
- Design and implementation of aggregate functions in the DLV system
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Evaluating ASP and commercial solvers on the CSPLib
- Extending and implementing the stable model semantics
- GASP: Answer set programming with lazy grounding
- GRASP: a search algorithm for propositional satisfiability
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic programming and knowledge representation---The A-Prolog perspective
- Logic programs with stable model semantics as a constraint programming paradigm
- Logics in Artificial Intelligence
- Multi-threaded ASP solving with clasp
- Normalizing cardinality rules using merging and sorting constructions
- On the computational cost of disjunctive logic programming: Propositional case
- Optimization Methods for the Partner Units Problem
- Propositional semantics for disjunctive logic programs
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- Semantics and complexity of recursive aggregates in answer set programming
- Team-building with answer set programming in the Gioia-Tauro seaport
- The DLV system for knowledge representation and reasoning
- The intelligent grounder of DLV
- Theory and Applications of Satisfiability Testing
- Tight logic programs
- Unfolding partiality and disjunctions in stable model semantics
Cited in
(39)- The Sixth Answer Set Programming Competition
- Graph-based construction of minimal models
- Solution Enumeration by Optimality in Answer Set Programming
- scientific article; zbMATH DE number 7453100 (Why is no real title available?)
- Better paracoherent answer sets with less resources
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Coalition formation in social environments with logic-based agents1
- FOLASP: FO(·) as Input Language for Answer Set Solvers
- Multi-level Algorithm Selection for ASP
- The Seventh Answer Set Programming Competition: Design and Results
- Debugging non-ground ASP programs: technique and graphical tools
- Shared aggregate sets in answer set programming
- Logic programming
- Estimating grounding sizes of logic programs under answer set semantics
- The design of the Seventh Answer Set Programming Competition
- Testing in ASP: revisited language and programming environment
- Design and results of the second international competition on computational models of argumentation
- Eighth ASPOCP international workshop on ``Answer set programming and other computing paradigms
- plasp 3: towards effective ASP planning
- Query answering in resource-based answer set semantics
- Optimizing answer set computation via heuristic-based decomposition
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- ASP-Core-2 input language format
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- The Design of the Sixth Answer Set Programming Competition
- scientific article; zbMATH DE number 7455725 (Why is no real title available?)
- Rewriting optimization statements in answer-set programs
- Preface
- Paracoherent answer set computation
- Performance tuning in answer set programming
- ASP solving for expanding universes
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- Logic Programming and Nonmonotonic Reasoning
- Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
- Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
- On the complexity of the partner units decision problem
- Stable-unstable semantics: Beyond NP with normal logic programs
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- New models for generating hard random Boolean formulas and disjunctive logic programs
Describes a project that uses
Uses Software
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)
