Train Scheduling with Hybrid Answer Set Programming
From MaRDI portal
Publication:4957222
DOI10.1017/S1471068420000046OpenAlexW3012364298MaRDI QIDQ4957222
Julian Jordi, Ambra Toletti, Torsten Schaub, Max Ostrowski, Philipp Wanko, Dirk Abels
Publication date: 3 September 2021
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.08598
constraintsknowledge representation and nonmonotonic reasoninglogic programming methodology and application
Related Items (2)
Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling ⋮ Tunas -- fishing for diverse answer sets: a multi-shot trade up strategy
Uses Software
Cites Work
- Solving constraint satisfaction problems with SAT modulo theories
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Train scheduling with hybrid ASP
- Benchmarks for basic scheduling problems
- Modeling and Solving the Train Timetabling Problem
- Clingo goes linear constraints over reals and integers
- Abstract gringo
- Multi-shot ASP solving with clingo
- Unsatisfiability-based optimization in clasp
This page was built for publication: Train Scheduling with Hybrid Answer Set Programming