4 papers
The Smallest String Attractors of Fibonacci and Period-Doubling Words
Mutsunori Banbara, Hideo Bannai, Peaker Guo +3
A string attractor of a string is a set of positions of such that any substring of has an occurrence that crosses a position in , i.e., there is a…
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…