Hidetomo Nabeshima

40 papers A* 4A 3B 9C 3Journal 10Unranked 11
YearRankTypeTitle / Venue / Authors
2025 A conf
SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints.
SAT
Ryoga Ohashi, Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Katsumi Inoue, Naoyuki Tamura
2025 B conf
The ASP-based Nurse Scheduling System at the University of Yamanashi Hospital.
ICLP
Hidetomo Nabeshima, Mutsunori Banbara, Torsten Schaub, Takehide Soh
2024 B conf
ASP-Based Large Neighborhood Prioritized Search for Course Timetabling.
LPNMR
Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
2024 J jnl
International Competition on Graph Counting Algorithms 2023.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato
2024 A* conf
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming.
KR
Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
2024 J jnl
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming.
CoRR
Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
2023 B conf
Hamiltonian Cycle Reconfiguration with Answer Set Programming.
JELIA
Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura
2023 J jnl
International Competition on Graph Counting Algorithms 2023.
CoRR
Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato
2020 A conf
Reproducible Efficient Parallel SAT Solving.
SAT
Hidetomo Nabeshima, Katsumi Inoue
2017 A conf
Coverage-Based Clause Reduction Heuristics for CDCL Solvers.
SAT
Hidetomo Nabeshima, Katsumi Inoue
2015 — conf
Completing signaling networks by abductive reasoning with perturbation experiments.
ILP (Late Breaking Papers)
Adrien Rougny, Yoshitaka Yamamoto, Hidetomo Nabeshima, Gauvain Bourgne, Anne Poupon, Katsumi Inoue, Christine Froidevaux
2015 J jnl
Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers.
IEICE Trans. Inf. Syst.
Masahiko Sakai, Hidetomo Nabeshima
2014 — conf
Completing SBGN-AF Networks by Logic-Based Hypothesis Finding.
FMMB
Yoshitaka Yamamoto, Adrien Rougny, Hidetomo Nabeshima, Katsumi Inoue, Hisao Moriya, Christine Froidevaux, Koji Iwanuma
2013 J jnl
Completing causal networks by meta-level abduction.
Mach. Learn.
Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima
2013 B conf
On-the-Fly Lazy Clause Simplification Based on Binary Resolvents.
ICTAI
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
2011 — conf
Discretized Kinetic Models for Abductive Reasoning in Systems Biology.
BIOSTEC (Selected Papers)
Gabriel Synnaeve, Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima, Yoshitaka Kameya, Masakazu Ishihata, Taisuke Sato
2011 — conf
Kinetic Models and Qualitative Abstraction for Relational Learning in Systems Biology.
BIOINFORMATICS
Gabriel Synnaeve, Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima, Yoshitaka Kameya, Masakazu Ishihata, Taisuke Sato
2010 J jnl
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem.
Fundam. Informaticae
Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima
2010 B conf
Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction.
ILP
Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima
2010 J jnl
SOLAR: An automated deduction system for consequence finding.
AI Commun.
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, Oliver Ray
2010 J jnl
Solving Open Job-Shop Scheduling Problems by SAT Encoding.
IEICE Trans. Inf. Syst.
Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa
2009 B conf
Discovering Rules by Meta-level Abduction.
ILP
Katsumi Inoue, Koichi Furukawa, Ikuo Kobayashi, Hidetomo Nabeshima
2009 A* conf
Evaluating Abductive Hypotheses using an EM Algorithm on BDDs.
IJCAI
Katsumi Inoue, Taisuke Sato, Masakazu Ishihata, Yoshitaka Kameya, Hidetomo Nabeshima
2009 — conf
Minimal Model Generation with Respect to an Atom Set.
FTP
Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa
2009 J jnl
Reconsideration of circumscriptive induction with pointwise circumscription.
J. Appl. Log.
Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima
2009 — conf
Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation.
FTP
Koji Iwanuma, Hidetomo Nabeshima, Katsumi Inoue
2008 — conf
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem.
RCRA
Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima
2008 — conf
Complete Pruning Methods and a Practical Search Strategy for SOL.
LPAR Workshops
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
2006 J jnl
Consequence finding and computing answers with defaults.
J. Intell. Inf. Syst.
Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima
2006 A* conf
Lemma Reusing for SAT based Planning and Scheduling.
ICAPS
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma
2006 — conf
Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-Automatic Training-Example Generation.
Web Intelligence
Hidetomo Nabeshima, Reiko Miyagawa, Yuki Suzuki, Koji Iwanuma
2005 — conf
Effective SAT Planning by Lemma-Reusing.
Artificial Intelligence and Applications
Hidetomo Nabeshima, Hirohito Nozawa, Koji Iwanuma
2005 A* conf
Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm.
ICDM
Koji Iwanuma, Ryuichi Ishihara, Yo Takano, Hidetomo Nabeshima
2005 B conf
Inducing Causal Laws by Regular Inference.
ILP
Katsumi Inoue, Hideyuki Bando, Hidetomo Nabeshima
2005 C conf
Upside-Down Transformation in SOL/Connection Tableaux and Its Application.
ICTAC
Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima
2004 C conf
Consequence Finding in Default Theories.
FQAS
Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima
2003 B conf
SOLAR: A Consequence Finding System for Advanced Reasoning.
TABLEAUX
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
2002 C conf
A Case-Based Recognition of Semantic Structures in HTML Documents.
IDEAL
Masayuki Umehara, Koji Iwanuma, Hidetomo Nabeshima
2002 — conf
Effective SAT Planning by Speculative Computation.
Australian Joint Conference on Artificial Intelligence
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
2000 B conf
Implementing an action language using a SAT solver.
ICTAI
Hidetomo Nabeshima, Katsumi Inoue, Hiromasa Haneda