2 citations · 4 across the 9 of their papers we have counts for
5 papers · 1 filter
The ASP-based Nurse Scheduling System at the University of Yamanashi Hospital
Hidetomo Nabeshima, Mutsunori Banbara, Torsten Schaub +1
We present the design principles of a nurse scheduling system built using Answer Set Programming (ASP) and successfully deployed at the University of Yamanashi Hospital. Nurse sche…
Dominating Set Reconfiguration with Answer Set Programming
Masato Kato, Torsten Schaub, Takehide Soh +2
The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the oth…
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming
Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima +4
We propose Large Neighborhood Prioritized Search (LNPS) for solving combinatorial optimization problems in Answer Set Programming (ASP). LNPS is a metaheuristic that starts with an…
Bounded Combinatorial Reconfiguration with Answer Set Programming
Yuya Yamada, Mutsunori Banbara, Katsumi Inoue +1
We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on Answer Set Programming (ASP). The general task is to…
Clingcon: The Next Generation
Mutsunori Banbara, Benjamin Kaufmann, Max Ostrowski +1
We present the third generation of the constraint answer set system clingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP). While its predec…