Train scheduling with hybrid ASP

DOI10.1007/978-3-030-20528-7_1OpenAlexW2946766242MaRDI QIDQ2326704

Julian Jordi, Ambra Toletti, Dirk Abels, Philipp Wanko, Max Ostrowski, Torsten Schaub

Publication date: 10 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-20528-7_1

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (5)

Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Answer set programming made easy ⋮ Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More ⋮ Train Scheduling with Hybrid Answer Set Programming ⋮ Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP

This page was built for publication: Train scheduling with hybrid ASP