Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
From MaRDI portal
Publication:2694562
DOI10.1007/978-3-031-15707-3_12OpenAlexW4293179858MaRDI QIDQ2694562FDOQ2694562
Carmine Dodaro, F. Ricca, Luca Oneto, Davide Ilardi
Publication date: 4 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_12
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- Advances in WASP
- Learning representations by back-propagating errors
- Understanding Machine Learning
- Model Selection and Error Estimation in a Nutshell
- Multilayer feedforward networks are universal approximators
- Design and results of the Fifth Answer Set Programming Competition
- Machine learning-based restart policy for CDCL SAT solvers
- Efficiently Coupling the I-DLV Grounder with ASP Solvers
- Guiding high-performance SAT solvers with unsat-core predictions
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
- Improving Coordinated SMT-Based System Synthesis by Utilizing Domain-Specific Heuristics
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Heuristic algorithms and learning techniques: applications to the graph coloring problem 👍 👎
- The complexity and generality of learning answer set programs 👍 👎
- Scalable neural-probabilistic answer set programming 👍 👎
- Graphs and colorings for answer set programming 👍 👎
- Learning domain-specific heuristics for answer set solvers 👍 👎
- Logic Programming and Nonmonotonic Reasoning 👍 👎
This page was built for publication: Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2694562)
