activity
20132025
most citedImplementing Efficient All Solutions SAT Solvers

56 citations · 59 across the 7 of their papers we have counts for

collaborators

7 papers

cs.AI2025

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…

cs.AI2024★ 1 cited

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…

cs.AI2024

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…

cs.AI2022★ 1 cited

Core Challenge 2022: Solver and Graph Descriptions

Takehide Soh, Yoshio Okamoto, Takehiro Ito

This paper collects all descriptions of solvers and ISR instances submitted to CoRe Challenge 2022.

cs.DS2022★ 1 cited

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems

Takehiro Ito, Jun Kawahara, Yu Nakahata +4

This paper proposes an algorithmic framework for various reconfiguration problems using zero-suppressed binary decision diagrams (ZDDs), a data structure for families of sets. In g…

cs.DS2015★ 56 cited

Implementing Efficient All Solutions SAT Solvers

Takahisa Toda, Takehide Soh

All solutions SAT (AllSAT for short) is a variant of propositional satisfiability problem. Despite its significance, AllSAT has been relatively unexplored compared to other variant…

cs.AI2013

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…