Implementing an action language using a SAT solver. - Hidetomo Nabeshima; Katsumi Inoue; Hiromasa Haneda (ICTAI, 2000)

Effective SAT Planning by Speculative Computation. - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (Australian Joint Conference on Artificial Intelligence, 2002)

A Case-Based Recognition of Semantic Structures in HTML Documents. - Masayuki Umehara; Koji Iwanuma; Hidetomo Nabeshima (IDEAL, 2002)

SOLAR: A Consequence Finding System for Advanced Reasoning. - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (TABLEAUX, 2003)

Consequence Finding in Default Theories. - Katsumi Inoue; Koji Iwanuma; Hidetomo Nabeshima (FQAS, 2004)

Effective SAT Planning by Lemma-Reusing. - Hidetomo Nabeshima; Hirohito Nozawa; Koji Iwanuma (Artificial Intelligence and Applications, 2005)

Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm. - Koji Iwanuma; Ryuichi Ishihara; Yo Takano; Hidetomo Nabeshima (ICDM, 2005)

Upside-Down Transformation in SOL/Connection Tableaux and Its Application. - Koji Iwanuma; Katsumi Inoue; Hidetomo Nabeshima (ICTAC, 2005)

Inducing Causal Laws by Regular Inference. - Katsumi Inoue; Hideyuki Bando; Hidetomo Nabeshima (ILP, 2005)

Lemma Reusing for SAT based Planning and Scheduling. - Hidetomo Nabeshima; Takehide Soh; Katsumi Inoue; Koji Iwanuma (ICAPS, 2006)

Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-Automatic Training-Example Generation. - Hidetomo Nabeshima; Reiko Miyagawa; Yuki Suzuki; Koji Iwanuma (Web Intelligence, 2006)

Consequence finding and computing answers with defaults. - Katsumi Inoue; Koji Iwanuma; Hidetomo Nabeshima (J. Intell. Inf. Syst., 2006)

Complete Pruning Methods and a Practical Search Strategy for SOL. - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (LPAR Workshops, 2008)

Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation. - Koji Iwanuma; Hidetomo Nabeshima; Katsumi Inoue (FTP, 2009)

Minimal Model Generation with Respect to an Atom Set. - Miyuki Koshimura; Hidetomo Nabeshima; Hiroshi Fujita 002; Ryuzo Hasegawa (FTP, 2009)

Evaluating Abductive Hypotheses using an EM Algorithm on BDDs. - Katsumi Inoue; Taisuke Sato; Masakazu Ishihata; Yoshitaka Kameya; Hidetomo Nabeshima (IJCAI, 2009)

Discovering Rules by Meta-level Abduction. - Katsumi Inoue; Koichi Furukawa; Ikuo Kobayashi; Hidetomo Nabeshima (ILP, 2009)

Reconsideration of circumscriptive induction with pointwise circumscription. - Koji Iwanuma; Katsumi Inoue; Hidetomo Nabeshima (J. Appl. Log., 2009)

Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction. - Katsumi Inoue; Andrei Doncescu; Hidetomo Nabeshima (ILP, 2010)

SOLAR: An automated deduction system for consequence finding. - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue; Oliver Ray (AI Commun., 2010)

A SAT-based Method for Solving the Two-dimensional Strip Packing Problem. - Takehide Soh; Katsumi Inoue; Naoyuki Tamura; Mutsunori Banbara; Hidetomo Nabeshima (Fundam. Informaticae, 2010)

Solving Open Job-Shop Scheduling Problems by SAT Encoding. - Miyuki Koshimura; Hidetomo Nabeshima; Hiroshi Fujita 002; Ryuzo Hasegawa (IEICE Trans. Inf. Syst., 2010)

Kinetic Models and Qualitative Abstraction for Relational Learning in Systems Biology. - Gabriel Synnaeve; Katsumi Inoue; Andrei Doncescu; Hidetomo Nabeshima; Yoshitaka Kameya; Masakazu Ishihata; Taisuke Sato (BIOINFORMATICS, 2011)

Discretized Kinetic Models for Abductive Reasoning in Systems Biology. - Gabriel Synnaeve; Katsumi Inoue; Andrei Doncescu; Hidetomo Nabeshima; Yoshitaka Kameya; Masakazu Ishihata; Taisuke Sato (BIOSTEC (Selected Papers), 2011)

On-the-Fly Lazy Clause Simplification Based on Binary Resolvents. - Hidetomo Nabeshima; Koji Iwanuma; Katsumi Inoue (ICTAI, 2013)

Completing causal networks by meta-level abduction. - Katsumi Inoue; Andrei Doncescu; Hidetomo Nabeshima (Mach. Learn., 2013)

Completing SBGN-AF Networks by Logic-Based Hypothesis Finding. - Yoshitaka Yamamoto; Adrien Rougny; Hidetomo Nabeshima; Katsumi Inoue; Hisao Moriya; Christine Froidevaux; Koji Iwanuma (FMMB, 2014)

Completing signaling networks by abductive reasoning with perturbation experiments. - Adrien Rougny; Yoshitaka Yamamoto; Hidetomo Nabeshima; Gauvain Bourgne; Anne Poupon; Katsumi Inoue; Christine Froidevaux (ILP (Late Breaking Papers), 2015)

Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers. - Masahiko Sakai; Hidetomo Nabeshima (IEICE Trans. Inf. Syst., 2015)

Coverage-Based Clause Reduction Heuristics for CDCL Solvers. - Hidetomo Nabeshima; Katsumi Inoue (SAT, 2017)

Reproducible Efficient Parallel SAT Solving. - Hidetomo Nabeshima; Katsumi Inoue (SAT, 2020)

Hamiltonian Cycle Reconfiguration with Answer Set Programming. - Takahiro Hirate; Mutsunori Banbara; Katsumi Inoue; Xiao-Nan Lu; Hidetomo Nabeshima; Torsten Schaub; Takehide Soh; Naoyuki Tamura (JELIA, 2023)

Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. - Irumi Sugimori; Katsumi Inoue; Hidetomo Nabeshima; Torsten Schaub; Takehide Soh; Naoyuki Tamura; Mutsunori Banbara (KR, 2024)

ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. - Irumi Sugimori; Katsumi Inoue; Hidetomo Nabeshima; Torsten Schaub; Takehide Soh; Naoyuki Tamura; Mutsunori Banbara (LPNMR, 2024)

International Competition on Graph Counting Algorithms 2023. - Takeru Inoue; Norihito Yasuda; Hidetomo Nabeshima; Masaaki Nishino; Shuhei Denzumi; Shin-ichi Minato (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024)

SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints. - Ryoga Ohashi; Takehide Soh; Daniel Le Berre; Hidetomo Nabeshima; Mutsunori Banbara; Katsumi Inoue; Naoyuki Tamura (SAT, 2025)

The ASP-based Nurse Scheduling System at the University of Yamanashi Hospital. - Hidetomo Nabeshima; Mutsunori Banbara; Torsten Schaub; Takehide Soh (CoRR, 2025)