Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
From MaRDI portal
(Redirected from Publication:5140003)
Abstract: Answer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI. The traditional ground-and-solve approach, however, requires ASP programs to be grounded upfront and thus suffers from the so-called grounding bottleneck (i.e., ASP programs easily exhaust all available memory and thus become unsolvable). As a remedy, lazy-grounding ASP solvers have been developed, but many state-of-the-art techniques for grounded ASP solving have not been available to them yet. In this work we present, for the first time, adaptions to the lazy-grounding setting for many important techniques, like restarts, phase saving, domain-independent heuristics, and learned-clause deletion. Furthermore, we investigate their effects and in general observe a large improvement in solving capabilities and also uncover negative effects in certain cases, indicating the need for portfolio solving as known from other solvers. Under consideration for acceptance in TPLP.
Recommendations
- Degrees of laziness in grounding. Effects of lazy-grounding strategies on ASP solving
- Learning and using domain-specific heuristics in ASP solvers
- GASP: Answer set programming with lazy grounding
- scientific article; zbMATH DE number 1890620
- scientific article; zbMATH DE number 7453100
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- An abstract view on optimizations in SAT and ASP
- AI*IA 2005: Advances in Artificial Intelligence
- Lazy clause generation: combining the power of SAT and CP (and MIP?) solving
Cites work
- scientific article; zbMATH DE number 5914361 (Why is no real title available?)
- scientific article; zbMATH DE number 7453100 (Why is no real title available?)
- scientific article; zbMATH DE number 956861 (Why is no real title available?)
- BerkMin: A fast and robust SAT-solver
- Blending lazy-grounding and CDNL search for answer-set solving
- Conflict-driven answer set solving: from theory to practice
- Degrees of laziness in grounding. Effects of lazy-grounding strategies on ASP solving
- Design and results of the Fifth Answer Set Programming Competition
- Exploiting partial assignments for efficient evaluation of answer set programs with external source access
- GASP: Answer set programming with lazy grounding
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Lazy model expansion: interleaving grounding with search
- On the complexity of the partner units decision problem
- Optimal speedup of Las Vegas algorithms
- Optimization Methods for the Partner Units Problem
- Partial compilation of ASP programs
- Semantics and complexity of recursive aggregates in answer set programming
- The ASP system DLV2
- The DLV system for knowledge representation and reasoning
- Theory and Applications of Satisfiability Testing
- Train scheduling with hybrid ASP
- \textit{telingo} = ASP + time
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
Cited in
(11)- Prolog and ASP inference under one roof
- Degrees of laziness in grounding. Effects of lazy-grounding strategies on ASP solving
- On the foundations of grounding in answer set programming
- On the configuration of more and less expressive logic programs
- Aggregate semantics for propositional answer set programs
- scientific article; zbMATH DE number 7453100 (Why is no real title available?)
- Lazy atom discovery in compilation-based ASP solving
- Blending lazy-grounding and CDNL search for answer-set solving
- Lazy model expansion: interleaving grounding with search
- Lazy model expansion by incremental grounding
- GASP: Answer set programming with lazy grounding
This page was built for publication: Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140003)
