Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
From MaRDI portal
Publication:5140003
DOI10.1017/S1471068420000332zbMath1468.68228arXiv2008.03526OpenAlexW3088670598MaRDI QIDQ5140003
Richard Taupe, Gerhard Friedrich, Antonius Weinzierl
Publication date: 13 December 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.03526
Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantics and complexity of recursive aggregates in answer set programming
- Optimal speedup of Las Vegas algorithms
- Design and results of the Fifth Answer Set Programming Competition
- Conflict-driven answer set solving: from theory to practice
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Train scheduling with hybrid ASP
- \textit{telingo} = ASP + time
- Degrees of laziness in grounding. Effects of lazy-grounding strategies on ASP solving
- Blending lazy-grounding and CDNL search for answer-set solving
- The ASP system DLV2
- On the complexity of the partner units decision problem
- BerkMin: A fast and robust SAT-solver
- Optimization Methods for the Partner Units Problem
- GASP: Answer Set Programming with Lazy Grounding
- ASPeRiX, a first-order forward chaining approach for answer set computing
- Partial Compilation of ASP Programs
- Lazy Model Expansion: Interleaving Grounding with Search
- The DLV system for knowledge representation and reasoning
- Theory and Applications of Satisfiability Testing
This page was built for publication: Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
