Naoyuki Tamura
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Naoyuki Tamura has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
- Mutsunori Banbara
Nagoya University
23 shared publications - Takehide Soh
Kobe University
16 shared publications - Katsumi Inoue
National Institute of Informatics
10 shared publications - Torsten Schaub
Universität Potsdam
9 shared publications Mutsunori Banbara
Kobe University
6 shared publications- Hidetomo Nabeshima
University of Yamanashi
4 shared publications
Latest Publications
- 11 October 2026
- Published by Springer Nature
- p. 430-447
Adaptive Large Neighborhood Prioritized Search for Optimization in Answer Set Programming
- 11 October 2026
- Published by Springer Nature
- p. 430-447
Adaptive Large Neighborhood Prioritized Search for Optimization in Answer Set Programming
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 3, 2601-2609
A SAT-based Method for Counting All Singleton Attractors in Boolean Networks
Boolean networks (BNs) are widely used to model biological regulatory networks. Attractors here hold significant meaning as they represent long-term behaviors such as homeostasis and the results of cell differentiation. As such, computing attractors is of critical importance to guarantee the validity of a model or to assess its stability and robustness. However, this problem is quite challenging when it comes to large real-world models. To overcome the limits of state-of-the-art BDD-based or ASP-based enumeration approaches, we introduce a SAT-based approach to compute fixed points (singleton attractors) of BN and exhibit its merits for counting the number of singleton attractors of large-scale benchmarks well established in the literature.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 3, 2601-2609
Open AccessA SAT-based Method for Counting All Singleton Attractors in Boolean Networks
Boolean networks (BNs) are widely used to model biological regulatory networks. Attractors here hold significant meaning as they represent long-term behaviors such as homeostasis and the results of cell differentiation. As such, computing attractors is of critical importance to guarantee the validity of a model or to assess its stability and robustness. However, this problem is quite challenging when it comes to large real-world models. To overcome the limits of state-of-the-art BDD-based or ASP-based enumeration approaches, we introduce a SAT-based approach to compute fixed points (singleton attractors) of BN and exhibit its merits for counting the number of singleton attractors of large-scale benchmarks well established in the literature.
- 9 October 2024
- Published by Springer Nature
- p. 57-70
ASP-Based Large Neighborhood Prioritized Search for Course Timetabling
- 9 October 2024
- Published by Springer Nature
- p. 57-70
ASP-Based Large Neighborhood Prioritized Search for Course Timetabling
- Open Access
- 1 July 2024
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 24 (4) , 755-771
Dominating Set Reconfiguration with Answer Set Programming
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 other via a sequence of feasible solutions subject to a certain adjacency relation. This problem is PSPACE-complete in general. The concept of the dominating set is known to be quite useful for analyzing wireless networks, social networks, and sensor networks. We develop an approach to solve the dominating set reconfiguration problem based on answer set programming (ASP). Our declarative approach relies on a high-level ASP encoding, and both the grounding and solving tasks are delegated to an ASP-based combinatorial reconfiguration solver. To evaluate the effectiveness of our approach, we conduct experiments on a newly created benchmark set.
- 1 July 2024
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 24 (4) , 755-771
Open AccessDominating Set Reconfiguration with Answer Set Programming
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 other via a sequence of feasible solutions subject to a certain adjacency relation. This problem is PSPACE-complete in general. The concept of the dominating set is known to be quite useful for analyzing wireless networks, social networks, and sensor networks. We develop an approach to solve the dominating set reconfiguration problem based on answer set programming (ASP). Our declarative approach relies on a high-level ASP encoding, and both the grounding and solving tasks are delegated to an ASP-based combinatorial reconfiguration solver. To evaluate the effectiveness of our approach, we conduct experiments on a newly created benchmark set.
- 24 September 2023
- Published by Springer Nature
- p. 262-277
Hamiltonian Cycle Reconfiguration with Answer Set Programming
- 24 September 2023
- Published by Springer Nature
- p. 262-277
Hamiltonian Cycle Reconfiguration with Answer Set Programming
- 9 September 2023
- Published by Springer Nature
- p. 175-183
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks
- 9 September 2023
- Published by Springer Nature
- p. 175-183
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks
- 8 January 2023
- Published by Springer Nature
- p. 232-249
Solving Vehicle Equipment Specification Problems with Answer Set Programming
- 8 January 2023
- Published by Springer Nature
- p. 232-249
Solving Vehicle Equipment Specification Problems with Answer Set Programming
- 22 January 2018
- Published by Springer Nature in Annals of Operations Research
- Vol. 275 (1) , 3-37
${\varvec{teaspoon}}$: solving the curriculum-based course timetabling problems with answer set programming- 22 January 2018
- Published by Springer Nature in Annals of Operations Research
- Vol. 275 (1) , 3-37
${\varvec{teaspoon}}$: solving the curriculum-based course timetabling problems with answer set programming- 23 August 2017
- Published by Springer Nature
- p. 596-614
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation
- 23 August 2017
- Published by Springer Nature
- p. 596-614
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation
- 28 June 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 265-278
catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming
- 28 June 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 265-278
catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming