Hidetomo Nabeshima

Orcid: 0000-0003-3752-2518

According to our database1, Hidetomo Nabeshima authored at least 33 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
International Competition on Graph Counting Algorithms 2023.
CoRR, 2023

Hamiltonian Cycle Reconfiguration with Answer Set Programming.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

2020
Reproducible Efficient Parallel SAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

2017
Coverage-Based Clause Reduction Heuristics for CDCL Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2015
Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers.
IEICE Trans. Inf. Syst., 2015

Completing signaling networks by abductive reasoning with perturbation experiments.
Proceedings of the Late Breaking Papers of the 25th International Conference on Inductive Logic Programming, 2015

2014
Completing SBGN-AF Networks by Logic-Based Hypothesis Finding.
Proceedings of the Formal Methods in Macro-Biology - First International Conference, 2014

2013
Completing causal networks by meta-level abduction.
Mach. Learn., 2013

On-the-Fly Lazy Clause Simplification Based on Binary Resolvents.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

2011
Discretized Kinetic Models for Abductive Reasoning in Systems Biology.
Proceedings of the Biomedical Engineering Systems and Technologies, 2011

Kinetic Models and Qualitative Abstraction for Relational Learning in Systems Biology.
Proceedings of the BIOINFORMATICS 2011, 2011

2010
Solving Open Job-Shop Scheduling Problems by SAT Encoding.
IEICE Trans. Inf. Syst., 2010

A SAT-based Method for Solving the Two-dimensional Strip Packing Problem.
Fundam. Informaticae, 2010

SOLAR: An automated deduction system for consequence finding.
AI Commun., 2010

Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction.
Proceedings of the Inductive Logic Programming - 20th International Conference, 2010

2009
Reconsideration of circumscriptive induction with pointwise circumscription.
J. Appl. Log., 2009

Discovering Rules by Meta-level Abduction.
Proceedings of the Inductive Logic Programming, 19th International Conference, 2009

Evaluating Abductive Hypotheses using an EM Algorithm on BDDs.
Proceedings of the IJCAI 2009, 2009

Minimal Model Generation with Respect to an Atom Set.
Proceedings of the 7th International Workshop on First-Order Theorem Proving, 2009

Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation.
Proceedings of the 7th International Workshop on First-Order Theorem Proving, 2009

2008
Complete Pruning Methods and a Practical Search Strategy for SOL.
Proceedings of the LPAR 2008 Workshops, 2008

2006
Consequence finding and computing answers with defaults.
J. Intell. Inf. Syst., 2006

Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-Automatic Training-Example Generation.
Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

Lemma Reusing for SAT based Planning and Scheduling.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

2005
Inducing Causal Laws by Regular Inference.
Proceedings of the Inductive Logic Programming, 15th International Conference, 2005

Upside-Down Transformation in SOL/Connection Tableaux and Its Application.
Proceedings of the Theoretical Aspects of Computing, 2005

Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm.
Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

Effective SAT Planning by Lemma-Reusing.
Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2005

2004
Consequence Finding in Default Theories.
Proceedings of the Flexible Query Answering Systems, 6th International Conference, 2004

2003
SOLAR: A Consequence Finding System for Advanced Reasoning.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

2002
A Case-Based Recognition of Semantic Structures in HTML Documents.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2002

Effective SAT Planning by Speculative Computation.
Proceedings of the AI 2002: Advances in Artificial Intelligence, 2002

2000
Implementing an action language using a SAT solver.
Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), 2000


  Loading...