1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
Mutsunori Banbara, Martin Gebser, Katsumi Inoue +4
Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We…