The following pages link to Train scheduling with hybrid ASP (Q2326704):
Displaying 7 items.
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP (Q2055805) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Train Scheduling with Hybrid Answer Set Programming (Q4957222) (← links)
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More (Q5140003) (← links)
- Answer set programming made easy (Q6175107) (← links)
- Contrastive explanations for answer-set programs (Q6545521) (← links)
- Adaptive large-neighbourhood search for optimisation in answer-set programming (Q6665706) (← links)
