Progress in clasp Series 3

@inproceedings{Gebser2015ProgressIC,
  title={Progress in clasp Series 3},
  author={M. Gebser and Roland Kaminski and Benjamin Kaufmann and Javier Romero and Torsten Schaub},
  booktitle={LPNMR},
  year={2015}
}
We describe the novel functionalities comprised in clasp’s series 3. This includes parallel solving of disjunctive logic programs, parallel optimization with orthogonal strategies, declarative support for specifying domain heuristics, a portfolio of prefabricated expert configurations, and an application programming interface for library integration. This is complemented by experiments evaluating clasp 3’s optimization capacities as well as the impact of domain heuristics. 
What's Hot in the Answer Set Programming Competition
TLDR
The ASP competition series aims at assessing and promoting the evolution of ASP systems and applications, and its growing range of challenging application-oriented benchmarks inspires and showcases continuous advancements of the state of the art in ASP.
Completion of Disjunctive Logic Programs
TLDR
Clark's completion is extended to disjunctive programs without the need of intermediate program rewritings such as the shift, and an ad-hoc propagator for supported model search is presented.
ASPQ: An ASP-Based 2QBF Solver
TLDR
This paper shows how to obtain a fairly effective 2QBF solver by just resorting to state-of-the-art ASP solvers.
Evaluation Techniques and Systems for Answer Set Programming: a Survey
TLDR
This paper traces the history of ASP systems, describing the key evaluation techniques and their implementation in actual tools.
Evaluation of Disjunctive Programs in WASP
TLDR
The new version of wasp includes several improvements of the main solving strategies and advanced reasoning techniques for computing paracoherent answer sets, including ad-hoc techniques to efficiently handle disjunctive logic programs.
Empowering ASPQ to Win in QBFEval 2018
TLDR
This work describes how to obtain ASPQ, a fairly effective 2QBF solver, by just resorting to state of the art ASP solvers, and optimized it to exploit some unexpressed potential of its solving strategy.
Shift Design with Answer Set Programming
TLDR
This paper provides an ASP encoding of the shift design problem, aiming at an alignment of a minimum number of shifts in order to meet required numbers of employees in such a way that over- and understaffing is minimized.
Shift Design with Answer Set Programming
TLDR
This paper provides an ASP encoding of the shift design problem, aiming at an alignment of a minimum number of shifts in order to meet required numbers of employees in such a way that over- and understaffing is minimized.
Partial Compilation of ASP Programs
TLDR
This paper proposes an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm and might not be subject to the grounding step, and presents the related partial compilation technique.
The Seventh Answer Set Programming Competition: Design and Results
TLDR
The design and results of the Seventh ASP Competition are reported on, jointly organized by the University of Calabria, theUniversity of Genova, and the university of Potsdam in affiliation with the 14th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR 2017).
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
Advanced Conflict-Driven Disjunctive Answer Set Solving
TLDR
Novel characterizations of answer sets and unfounded sets are developed allowing for a bidirectional dynamic information exchange between solver units for orthogonal tasks, resulting in the new multithreaded disjunctive ASP solver claspD-2.
Domain-Specific Heuristics in Answer Set Programming
We introduce a general declarative framework for incorporating domain-specific heuristics into ASP solving. We accomplish this by extending the first-order modeling language of ASP by a distinguished
Multi-threaded ASP solving with clasp
TLDR
The new multi-threaded version of the state-of-the-art answer set solver clasp is presented, which detail its component and communication architecture and illustrate how they support the principal functionalities of clasp.
Advanced Preprocessing for Answer Set Solving
TLDR
The first substantial approach to preprocessing in the context of answer set solving is introduced, to simplify a logic program while identifying equivalences among its relevant constituents in terms of Boolean constraints.
ASP modulo CSP: The clingcon system
TLDR
The solver clingcon is developed, which follows the approach of modern Satisfiability Modulo Theories (SMT), and shall contribute to bridging the gap between Boolean and Non-Boolean reasoning, in order to bring out the best of both worlds.
Preliminary Report on WASP 2.0
TLDR
Improvements to the core evaluation algorithms working on normal programs of the ASP solver WASP are reported, showing a substantial increase in performance.
Conflict-Driven Disjunctive Answer Set Solving
TLDR
A uniform approach to computing answer sets of disjunctive logic programs based on state-of-the-art Boolean constraint solving techniques, featuring backjumping and conflict-driven learning using the First-UIP scheme as well as sophisticated unfounded set checking.
Conflict-driven answer set solving: From theory to practice
A Lightweight Component Caching Scheme for Satisfiability Solvers
TLDR
A lightweight technique for reducing work repetition caused by non-chronological backtracking commonly practiced by DPLL-based SAT solvers and can be viewed as a partial component caching scheme.
Unsatisfiability-based optimization in clasp
TLDR
The ASP solver clasp is extended with optimization components based upon the computation of minimal unsatisfiable cores and the resulting system, unclasp, is based on an extension of the well-known algorithms msu1 and msu3 and tailored to the characteristics of ASP.
...
1
2
3
4
...