Updated on 2024/06/30

写真a

 
Nabeshima Hidetomo
 
Organization
Graduate Faculty of Interdisciplinary Research Faculty of Engineering Electrical and Electronic Information Engineering (Computer Science and Engineering) Associate Professor
Title
Associate Professor
Homepage
http://www.nabelab.org/

Research History

  • 山梨大学大学院医学工学総合研究部 准教授   准教授

    2009.1

  • 山梨大学大学院医学工学総合研究部 助教   助教

    2007.4 - 2008.12

  • 山梨大学大学院医学工学総合研究部 助手   助手

    2003.4 - 2007.3

  • 山梨大学工学部コンピュータ・メディア工学科 助手   助手

    2001.4 - 2003.3

  • 日本学術振興会 特別研究員   特別研究員

    1998.4 - 2001.3

Education

  • Kobe University

    1998.4 - 2001.3

    　 More details

    Country： Japan

    Course： Doctor later

  • Toyohashi University of Technology

    - 1998.3

    　 More details

    Country： Japan

  • Toyohashi University of Technology

    - 1996.3

    　 More details

    Country： Japan

Degree

  • 博士（工学） ( 神戸大学 )

Research Areas

  • Informatics / Intelligent informatics  / Artificial Intelligence

  • Informatics / Theory of informatics  / アルゴリズム理論

  • Informatics / Software  / 並列・分散処理

Research Interests

  • Propositional Satisfiability Testing (SAT)

  • Consequence Finding for Full Clausal Theories

  • Knowledge Representation and Reasoning

  • Planning and Scheduling

  • Artificial Intelligence

  • Constraint Satisfaction Problem

Subject of research

  • Study on Knowledge Representation, Automated Reasoning and Constraint Satisfaction

Proposed theme of joint or funded research

  • 制約充足問題の高速解法

    　More details

    Possible form of cooperation：Technical Consultation,　Funded Research,　Cooperative Research Type of joint or funded research proposed：Wish to undertake joint research with industry and other organizations including private sector.

Research Projects

  • 並列充足可能性判定器の実用的基盤の実現

    2023.4 - 2026.3

    　 More details

    Authorship：Principal investigator  Type of fund：：Science research expense

  • 社会を志向した革新的アルゴリズムの実装

    2020.11 - 2025.3

    学術変革領域研究(A)

    安田 宜仁

    　 More details

    Authorship：Coinvestigator(s)  Type of fund：：Science research expense

  • データマイニングを利用したＡＴＭパフォーマンス等の分析

    2018.7 - 2019.9

    株式会社 山梨中央銀行 

    鍋島 英知，山本 泰生

    　 More details

    Authorship：Principal investigator  Type of fund：：Joint research

    各種情報をもとにＡＴＭのパフォーマンス等を分析し、顧客利便性の提供とコスト負担のバランスを考慮した最適なＡＴＭ設置場所を検討する。

  • Research on an Integrated System for Fast SAT Planning

    Grant number：12680384  2000 - 2001

    Japan Society for the Promotion of Science  Kobe University  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (C)

    INOUE Katsumi, NABESHIMA Hidetomo, HANEDA Hiromasa

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Competitive  Type of fund：：Science research expense

    SAT planning is a fast planning method which converts a planning problem into a satisfiability (SAT) problem and extracts a plan by solving the SAT problem using a fast SAT solver. In this research, we have developed an integrated action language processing system AMP to perform fast SAT planning on domain descriptions described in action languages : The contributions of the research can be summerized as follows.
    1. We have developed several algorithms to convert domain descriptions described in action languages into SAT problems. In particular, we have considered an algorithm which transforms planning problems involving nondeterministic actions into SAT problems.
    2. We have implemented several planning engines in AMP. Using planning graphs as data structures, we have developed forward/backward/mixed graph expansion algorithms to perform planning as fast as possible. We have also designed our system to have multiple SAT solvers for SAT planning. Depending on the feature of a problem, some SAT solvers perform better than others.
    3. We have considered learning algorithms for speed-up planning. Given observations that describe fluent values after performing action sequences, learning algorithms induce causal relationships between actions and their effects.
    4. AMP has been implemented in Java, and has an ability to draw planning graphs for interactive uses. Experimental results with big benchmark problems show that the performance of AMP is comparable to one of the fastest planner in the world. Unlike previous systems, however, AMP can interpret a description in an action language directly, and can answer queries for not only planning but model generation efficiently.

Papers

  • International Competition on Graph Counting Algorithms 2023

    Takeru INOUE, Norihito YASUDA, Hidetomo NABESHIMA, Masaaki NISHINO, Shuhei DENZUMI, Shin-ichi MINATO

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   2024.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1587/transfun.2023DMP0006

  • Hamiltonian Cycle Reconfiguration with Answer Set Programming Reviewed International coauthorship

    Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura

    In: S. Gaggl et al. (eds.), Logics in Artificial Intelligence, Proceedings of the 18th European Conference (JELIA 2023), Lecture Notes in Artificial Intelligence   14281   to appear - 16p.   2023.9( ISSN：0302-9743  ISBN：9783031436185  eISSN：1611-3349 )

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Springer  

    DOI： 10.1007/978-3-031-43619-2_19

  • DPS: A Framework for Deterministic Parallel SAT Solvers Reviewed Major achievement

    Hidetomo Nabeshima Tsubasa Fukiage Yuto Obitsu Xiao-Nan Lu Katsumi Inoue

    The 12th International Workshop on Pragmatics of SAT (PoS 2022)   1 - 15   2022.8

    　More details

    Authorship：Lead author   Language：English   Publishing type：Research paper (research society, symposium materials, etc.)  

  • DPS-Kissat

    Hidetomo Nabeshima, Tsubasa Fukiage, Yuto Obitsu, Xiao-Nan Lu, Katsumi Inoue

    Proceedings of SAT Competition 2022: Solver and Benchmark Descriptions   43 - 43   2022.8

    　More details

    Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (other science council materials etc.)  

  • Towards CEGAR-Based Parallel SAT Solving Reviewed

    Takehide Soh Hidetomo Nabeshima Mutsunori Banbara Naoyuki Tamura Katsumi Inoue

    The 11th International Workshop on Pragmatics of SAT (PoS 2021)   1 - 13   2021.7

    　More details

    Language：English   Publishing type：Research paper (research society, symposium materials, etc.)  

  • Reproducible Efficient Parallel SAT Solving Reviewed Major achievement

    Hidetomo NABESHIMA Katsumi INOUE

    In Proceedings of the 23th International Conference Theory and Applications of Satisfiability Testing (SAT 2020), LNCS   12178   123 - 138   2020.6

    　More details

    Authorship：Lead author   Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Springer, Cham  

    DOI： 10.1007/978-3-030-51825-7_10

  • 学生の選好に同順位を含む研究室配属問題 Reviewed Major achievement

    藤井 樹，伊藤 靖展，鍋島 英知

    人工知能学会論文誌   34 ( 3 )   2019.5

    　More details

    Authorship：Last author,　Corresponding author   Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：人工知能学会  

  • SATソルバーの最新動向と利用技術 Reviewed

    宋 剛秀, 番原 睦則, 田村 直之, 鍋島 英知

    コンピュータソフトウェア   35 ( 4 )   72 - 92   2018.11

    　More details

    Authorship：Last author   Language：Japanese   Publishing type：Research paper (scientific journal)  

    DOI： 10.11309/jssst.35.72

  • Coverage-Based Clause Reduction Heuristics for CDCL Solvers Reviewed Major achievement

    Hidetomo Nabeshima Katsumi Inoue

    Proceedings of the 20th International Conference Theory and Applications of Satisfiability Testing (SAT 2017)   10491   136 - 144   2017.8( ISSN：1611-3349 )

    　More details

    Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Springer, Cham  

    Many heuristics, such as decision, restart, and clause reduction heuristics, are incorporated in CDCL solvers in order to improve performance. In this paper, we focus on learnt clause reduction heuristics, which are used to suppress memory consumption and sustain propagation speed. The reduction heuristics consist of evaluation criteria, for measuring the usefulness of learnt clauses, and a reduction strategy in order to select clauses to be removed based on the criteria. LBD (literals blocks distance) is used as the evaluation criteria in many solvers. For the reduction strategy, we propose a new concise schema based on the coverage ratio of used LBDs. The experimental results show that the proposed strategy can achieve higher coverage than the conventional strategy and improve the performance for both SAT and UNSAT instances.

    DOI： 10.1007/978-3-319-66263-3

  • An Incremental SAT Solving Library and its Applications Reviewed

    SAKO Tatsuya, SOH Takehide, BANBARA Mutsunori, TAMURA Naoyuki, NABESHIMA Hidetomo, INOUE Katsumi

    Computer Software   33 ( 4 )   16 - 29   2016.10( ISSN：0289-6540 )

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：Japan Society for Software Science and Technology  

    Remarkable improvements on SAT solvers over the last decade have led the success of SAT-based solvers. However, existing SAT-based solvers cannot efficiently solve optimization and enumeration problems since those solvers invoke SAT solvers multiple times from scratch and do not reuse search information such as learnt clauses. Recently, incremental SAT method has been proposed to efficiently solve these problems. In addition, such incremental SAT API is proposed in SAT Race 2015. In this paper, we propose iSAT, an extended incremental SAT API, and describe its application. This proposed API allows users to implement SAT-based systems concisely and within Java. We show the effectiveness of using iSAT through experimental results on shop-scheduling, N-queens, and Hamiltonian cycle problems.

    DOI： 10.11309/jssst.33.4_16

    Scopus

    CiNii Books

  • SAT技術の進化と応用

    番原 睦則 , 鍋島 英知

    情報処理   57 ( 8 )   704 - 709   2016.7

    　More details

    Language：Japanese   Publishing type：(MISC) Introduction and explanation (scientific journal)  

  • SATソルバーの最近の進展

    鍋島 英知, 岩沼 宏治, 井上 克巳

    情報処理   57 ( 8 )   724 - 729   2016.7

    　More details

    Authorship：Lead author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Introduction and explanation (scientific journal)  

  • Completing Signaling Networks by Abductive Reasoning with Perturbation Experiments Reviewed

    Adrien Rougny, Yoshitaka Yamamoto, Hidetomo Nabeshima, Gauvain Bourgne, Anne Poupon, Katsumi Inoue, Christine Froidevaux

    Late Breaking Papers of the 25th International Conference on Inductive Logic Programming (ILP 2015)   1636   95 - 100   2016

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：CEUR Workshop Proceedings  

  • Construction of an ROBDD for a PB-constraint in band form and related techniques for PB-solvers Reviewed

    Masahiko Sakai Hidetomo Nabeshima

    IEICE TRANSACTIONS on Information and Systems   E98-D   1121 - 1127   2015.6

    　More details

    Language：English  

  • Completing SBGN-AF Networks by Logic-Based Hypothesis Finding Reviewed International coauthorship

    Yoshitaka Yamamoto, Adrien Rougny, Hidetomo Nabeshima, Katsumi Inoue, Hisao Moriya, Christine Froidevaux, Koji Iwanuma

    FORMAL METHODS IN MACRO-BIOLOGY   8738   165 - 179   2014( ISSN：0302-9743 )

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：SPRINGER INT PUBLISHING AG  

    This study considers formal methods for finding unknown interactions of incomplete molecular networks using microarray profiles. In systems biology, a challenging problem lies in the growing scale and complexity of molecular networks. Along with high-throughput experimental tools, it is not straightforward to reconstruct huge and complicated networks using observed data by hand. Thus, we address the completion problem of our target networks represented by a standard markup language, called SBGN (in particular, Activity Flow). Our proposed method is based on logic-based hypothesis finding techniques; given an input SBGN network and its profile data, missing interactions can be logically generated as hypotheses by the proposed method. In this paper, we also show empirical results that demonstrate how the proposed method works with a real network involved in the glucose repression of S. cerevisiae.

    DOI： 10.1007/978-3-319-10398-3_14

    Web of Science

  • On-The-Fly Lazy Clause Simplification based on Binary Resolvents Reviewed Major achievement

    Proceedings of IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI 2013),   987 - 995   2013.11

    　More details

    Authorship：Lead author   Language：English  

  • Completing causal networks by meta-level abduction Reviewed

    Machine Learning   91 ( 2 )   239 - 277   2013.5

    　More details

    Authorship：Last author   Language：English  

  • Discretized Kinetic Models for Abductive Reasoning in Systems Biology Reviewed International coauthorship

    Gabriel Synnaeve, Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima, Yoshitaka Kameya, Masakazu Ishihata, Taisuke Sato

    In: Ana Fred, Joaquim Filipe, and Hugo Gamboa (eds.), Biomedical Engineering Systems and Technologies: Revised Selected Papers from the 4th International Joint Conference (BIOSTEC 2011), Communications in Computer and Information Science   273   141 - 154   2013.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/978-3-642-29752-6

  • GlueMiniSat 2.2.5: A Fast SAT Solver with An Aggressive Acquiring Strategy of Glue Clauses Reviewed Major achievement

    Computer Software   29 ( 4 )   146 - 160   2012.11

    　More details

    Authorship：Lead author   Language：Japanese  

  • Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction Reviewed

    Inductive Logic Programming: Revised Papers from the 20th International Conference (ILP'10)   6489   114 - 129   2011.6

    　More details

    Authorship：Last author   Language：English  

  • Kinetic Models and Qualitative Abstraction for Relational Learning in Systems Biology Reviewed

    Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2011)   44 - 54   2011.1

    　More details

    Language：English  

  • 一階論理上の等号推論：理論と実際

    岩沼宏治，鍋島英知，井上克巳

    コンピュータソフトウェア   28 ( 4 )   282 - 305   2011

    　More details

    Language：Japanese   Publishing type：(MISC) Introduction and explanation (scientific journal)  

  • Solving Open Job-Shop Scheduling Problems by SAT Encoding Reviewed

    Journal of IEICE Transactions on Information and Systems   93 ( 8 )   2316 - 2318   2010.8

    　More details

    Language：English  

  • A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Reviewed Major achievement

    Fundamenta Informaticae, IOS Press   102 ( 3月4日 )   467 - 487   2010.8

    　More details

    Authorship：Last author   Language：English  

  • Discovering Rules by Meta-level Abduction Reviewed Major achievement

    Luc De Raedt (ed.), Inductive Logic Programming: Revised Papers from the 19th International Conference (ILP'09), Lecture Notes in Artificial Intelligence   23 ( 2月3日 )   183 - 203   2010.7

    　More details

    Authorship：Last author   Language：English  

  • Hypothesizing about Networks by Meta-level Abduction Reviewed Major achievement

    The 20th International Conference on Inductive Logic Programming (ILP 2010)   2010.6

    　More details

    Authorship：Last author   Language：English  

  • SOLAR: An Automated Deduction System for Consequence Finding Reviewed Major achievement

    AI Communications   23 ( 2月3日 )   183 - 203   2010.3

    　More details

    Authorship：Lead author   Language：English  

  • SAT によるプランニングとスケジューリング Major achievement

    鍋島 英知

    人工知能学会誌   25 ( 1 )   114 - 121   2010

    　More details

    Authorship：Lead author,　Last author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Introduction and explanation (scientific journal)   Publisher：人工知能学会  

  • 高速SATソルバーの原理 Major achievement

    鍋島 英知,宋 剛秀

    人工知能学会誌   25 ( 1 )   68 - 76   2010

    　More details

    Authorship：Lead author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Introduction and explanation (scientific journal)   Publisher：人工知能学会  

  • SMT：個別理論を取り扱うSAT 技術 Major achievement

    岩沼 宏治,鍋島 英知

    人工知能学会誌   25 ( 1 )   86 - 95   2010

    　More details

    Language：Japanese   Publishing type：(MISC) Introduction and explanation (scientific journal)   Publisher：人工知能学会  

  • SAT変換による未解決ジョブショップスケジューリング問題への挑戦

    越村 三幸,鍋島 英知,藤田 博,長谷川 隆三

    スケジューリング・シンポジウム2009講演論文集   209 - 213   2009.9

    　More details

    Language：Japanese  

  • イベント系列マイニングを目的とする新聞記事からの時間情報に基づく単語抽出 Reviewed

    多田 知道,岩沼 宏治,鍋島 英知

    人工知能学会論文誌   24 ( 6 )   488 - 493   2009.8

    　More details

    Language：Japanese  

  • Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation Reviewed Major achievement

    Proceedings of the 7th International Workshop on First-Order Theorem Proving (FTP 2009)   19 - 33   2009.7

    　More details

    Language：English  

  • Minimal Model Generation with Respect to an Atom Set Reviewed Major achievement

    Proceedings of the 7th International Workshop on First-Order Theorem Proving (FTP 2009)   49 - 59   2009.7

    　More details

    Language：English  

  • Evaluating Abductive Hypotheses using an EM Algorithm on BDDs Reviewed

    Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09)   810 - 815   2009.7

    　More details

    Language：English  

  • Reconsideration of Circumscriptive Induction with Pointwise Circumscription Reviewed

    Journal of Applied Logic   7 ( 3 )   307 - 317   2009.5

    　More details

    Language：English  

  • A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Reviewed

    Proceedings of the 15th International RCRA workshop (RCRA 2008) on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion   25 - 39   2008.12

    　More details

    Language：English  

  • A Complete Pruning Methods and a Practical Search Strategy for SOL Reviewed

    Hidetomo Nabeshima,Koji Iwanuma,Katsumi Inoue

    Proceedings of the LPAR 2008 Workshops, Knowledge Exchange: Automated Provers and Proof Assistants, and the 7th International Workshop on the Implementation of Logics   ( 418 )   113 - 122   2008.11

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • A Lossless Data Compression Based on Grammatical Inference

    Yudistira Bayu, Iwanuma Koji, Nabeshima Hidetomo

    7 ( 2 )   353 - 354   2008.8

    　More details

    Authorship：Last author   Language：Japanese   Publishing type：Research paper (research society, symposium materials, etc.)   Publisher：Forum on Information Technology  

    CiNii Books

  • Reconsideration of Circumscriptive Induction with Pointwise Circumscription Reviewed

    Proceedings of 2007 Intternational Workshop on Abduction and Induction in Artificial Intelligence (AIAI'07)   50 - 64   2007.9

    　More details

    Language：English  

  • ショップ・スケジューリング問題のSAT変換による解法

    田村直之,多賀明子,番原睦則,宋剛秀,鍋島英知,井上克巳

    スケジューリング・シンポジウム2007講演論文集   97 - 102   2007.9

    　More details

    Language：Japanese  

  • Sequential Pattern Mining for Extracting Hierarchical Patterns

    YOSHIDA Osamu, IWANUMA Koji, NABESHIMA Hidetomo

    IEICE technical report   106 ( 618 )   45 - 48   2007.3( ISSN：0913-5685 )

    　More details

    Authorship：Last author   Language：Japanese   Publishing type：Research paper (research society, symposium materials, etc.)   Publisher：The Institute of Electronics, Information and Communication Engineers  

    In this work, we proposes sequential pattern mining technique to discover a hierarchical patterns having difficulty with extraction in existing algorithm. Therefore we use compression based on grammer inference.

    CiNii Books

  • 論理プログラムによるゲーム開発支援ツール GALOP の開発

    川上 広太,鍋島 英知,岩沼 宏治

    2006年度 山梨大学総合情報処理センター研究報告   10   2007.3

    　More details

    Language：Japanese  

  • Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-automatic Training-Example Generation Reviewed

    Proceedings of the International Conference on Web Intelligence 2006 (WI'06)   769 - 772   2006.12

    　More details

    Language：English  

  • 緩和法に基づく系列データからの頻出部分系列の高速マイニング Reviewed

    丸山育嗣,岩沼宏治,鍋島英知

    第５回情報科学技術レターズ   113 - 116   2006.9

    　More details

    Language：Japanese  

  • 専門検索エンジンの高速半自動生成法 Reviewed

    宮川礼子,鈴木悠生,鍋島英知,岩沼宏治

    第５回情報科学技術レターズ   355 - 358   2006.9

    　More details

    Language：Japanese  

  • Lemma Reusing for SAT based Planning and Scheduling Reviewed Major achievement

    Proceedings of the International Conference on Planning and Scheduling 2006 (ICAPS'06)   103 - 112   2006.6

    　More details

    Language：English  

  • News Clustering Based on Background Similarity

    HIROSE Chinatsu, IWANUMA Koji, NABESHIMA Hidetomo

    IEICE technical report   105 ( 594 )   25 - 30   2006.2( ISSN：0913-5685 )

    　More details

    Authorship：Last author   Language：Japanese   Publishing type：Research paper (research society, symposium materials, etc.)   Publisher：The Institute of Electronics, Information and Communication Engineers  

    For automatically generating a time-series event corpus, we propose background similarity as a new similarity measure between two short news articles, and give an article clustering method based on the background similarity. To measure background similarity, first we extract a set of seed words from each article. The seed words symbolizes the article. Using the set of seed words, we collect tens of articles, called background articles, which are articles containing the seed words. Secondly, we calculate a word-frequency-vector from background articles. Thirdly, we compute the cosine similarity between word-frequency-vectors, called background similarity. Experimental evaluation shows that our background similarity is appropriate for clustering news articles which describe a special event.

    CiNii Books

  • Consequence Finding and Computing Answers with Defaults Reviewed Major achievement

    Journal of Intelligent Information Systems   26   41 - 58   2006.1

    　More details

    Language：English  

  • 論理プログラムによるゲームのプロトタイプ開発支援ツールGALOPの開発 International coauthorship

    川上 広太, 鍋島 英知, 岩沼 宏治

    山梨大学総合情報処理センター研究報告   10   2006( ISSN：1343-9588 )

    　More details

    Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (bulletin of university, research institution)   Publisher：山梨大学  

    現在とても多くのゲームが作られており,グラフィクス技術の向上によってよりリアルなものへとなってきているが,そのゲームの本質は大きくは変わっていない.そこでゲームの本質的な部分であるデータの管理等を,手続き型言語よりも簡潔に書くことのできる論理プログラムによって記述し,見た目は単純なものを利用するゲームのプロトタイプを作成するツールの開発を行った.

    CiNii Books

  • Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm Reviewed

    Proceedings of The Fifth IEEE International Conference on Data Mining (ICDM '05)   186 - 193   2005.11

    　More details

    Language：English  

  • Upside-Down Transformation in SOL/Connection Tableaux and its Application Reviewed Major achievement

    Proceedings of International Colloquium on Theoretical Aspects of Computing (ICTAC05) (LNCS Vol.3722)   166 - 179   2005.10

    　More details

    Language：English  

  • 大規模データ系列中に頻出する部分系列のオンライン抽出アルゴリズム Reviewed

    石原龍一,岩沼宏治,鍋島英知

    第４回情報科学技術レターズ   89 - 92   2005.9

    　More details

    Language：Japanese  

  • Inducing Causal Laws by Regular Inference Reviewed Major achievement

    Proceedings of the15th International Conference (ILP 2005) (LNAI Vol.3625)   154 - 171   2005.8

    　More details

    Language：English  

  • リンク元コンテキストを用いた WEB 文書の最重要箇所の同定法

    小谷 忠史,林 直弘,鍋島 英知,岩沼 宏治

    2005年度 山梨大学総合情報処理センター研究報告   9   2005.3

    　More details

    Language：Japanese  

  • Effective Sat Planning by Lemma-Reusing Reviewed Major achievement

    Proceedings of the IASTED International Conference on Artificial Intelligence and Applications (AIA2005)   1 - 6   2005.2

    　More details

    Language：English  

  • On Anti-Monotone Frequency Measures for Extracting Sequential Patterns from a Single Very-Long Data Sequence Reviewed

    IEEE International Conference on Cybernetics and Intelligence Systems (CIS2004)   2004.12

    　More details

    Language：English  

  • 単一の長大なデータ系列上の系列パターンの出現尺度とその逆単調性 Reviewed

    高野洋,岩沼宏治,鍋島英知

    第３回情報科学技術レターズ   115 - 118   2004.9

    　More details

    Language：Japanese  

  • Consequence-finding in Default Theories Reviewed Major achievement

    Proceedings of the 6th International Conference (FQAS 2004) (LNAI Vol. 3055)   459 - 472   2004.6

    　More details

    Language：English  

  • エージェントのルール学習におけるGAとGPの特性比較と融合化による性能向上

    西村 崇征,岩沼 宏治,鍋島 英知

    2004年度 山梨大学総合情報処理センター研究報告   8   2004.3

    　More details

    Language：Japanese  

  • SOLAR: A Consequence Finding System for Advanced Reasoning. Reviewed Major achievement

    Automated Reasoning with Analytic Tableaux and Related Methods: Proceedings of the 11th International Conference (TABLEAUX 2003), Lecture Notes in Artificial Intelligence, 2796   257 - 263   2003.9

    　More details

    Language：English  

  • Detecting Two Sorts of Correspondences between HTML Documents for Extracting Temporal Differences Reviewed

    Proceedings of the Third IASTED International Conference on Artficial Intelligence and Applications (AIA2003)   611 - 616   2003.9

    　More details

    Language：English  

  • An Automated Synthesis System of HTML Wrappers Which Can Easly Be Used by Anyone

    MITSUI Ken, IWANUMA Koji, NABESHIMA Hidetomo

    IEICE technical report. Artificial intelligence and knowledge-based processing   103 ( 243 )   43 - 48   2003.7( ISSN：0913-5685 )

    　More details

    Authorship：Last author   Language：Japanese   Publishing type：Research paper (research society, symposium materials, etc.)   Publisher：The Institute of Electronics, Information and Communication Engineers  

    In this paper, we propose an automated synthesis system of HTML wrappers, which can easily be usedby anyone. The proposed synthesis system fully use .the text information embedded in a HTML documents, andnever demand an expert knowledge on the HTML language from an end user. An intended wrapper is specifiedthrough an information extraction example which can easily be made with the very familiar "cut&paste" operation.We also show, through experiments, that automatically-synthesised HTML wrappers can achieve high accuracy ofextracting informations from real WEB sites.

    CiNii Books

  • アクション言語Ａにおける行動規則の学習 Reviewed

    坂東 秀之,井上 克巳,鍋島 英知

    人工知能学会誌   18 ( 5 )   297 - 304   2003.5

    　More details

    Language：Japanese  

  • Effective SAT Planning by Speculative Computation Reviewed Major achievement

    Proceeding of 15th Australian Joint Conference on Artificial Intelligence (LNAI Vol.2557)   726 - 727   2002.12

    　More details

    Language：English  

  • A Case-Based Recognition of Semantic Structures in HTML Documents (An Automated Transformation from HTML to XML) Reviewed

    Masayuki Umehara,Koji Iwanuma,Hidetomo Nabeshima

    Proceedings of Third International Conference on Intelligent Data Engineering and Automated Learning (IDEAL 2002) (LNCS Vol.2412)   141 - 147   2002.8

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： https://doi.org/10.1007/3-540-45675-9_24

  • 事例に基づくシリーズ型HTML文書の意味論理 構造の自動認識 Reviewed

    梅原雅之,岩沼宏治,鍋島英知

    人工知能学会論文誌   17 ( 6E )   690 - 698   2002.6

    　More details

    Language：Japanese  

  • Planning in Nondeterministic Action Language NA

    OKUZAWA Nozomu, NABESHIMA Hidetomo, INOUE Katsumi, HANEDA Hiromasa

    IPSJ SIG Notes. ICS   2001 ( 97 )   7 - 12   2001.10( ISSN：0919-6072 )

    　More details

    Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (research society, symposium materials, etc.)   Publisher：Information Processing Society of Japan (IPSJ)  

    Recent work on representing action has introduced high-level action languages to describe effects of actions in a systematic and theoretically sound way. In this paper, we define a new planning algorithm in the nondeterministic action language NA which is an action language for describing nondeterministic actions. We can find credulous plans in domains of NA by using this algorithm. To this end, we define an algorithm to transfer NA to the deterministic action language A. And, we prove this algorithm.

    CiNii Books

    Other Link： http://id.nii.ac.jp/1001/00050584/

  • プランニンググラフとSATプランニング Major achievement

    鍋島 英知,井上 克已

    人工知能学会誌   16 ( 5 )   605 - 610   2001.9

    　More details

    Authorship：Lead author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Introduction and explanation (scientific journal)   Publisher：人工知能学会  

  • Implementing an ActionLanguage Using a SAT Solver Reviewed Major achievement

    Proceeding of 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI2000)   96 - 103   2000.11

    　More details

    Language：English  

  • 有限オートマトンに基づく非決定性アクション言語 Reviewed Major achievement

    鍋島英知,井上克已,羽根田博正

    情報処理学会論文誌   40 ( 10 )   3661 - 3671   1999.10

    　More details

    Language：Japanese  

  • アクション言語Aのためのオートマトン理論 Reviewed Major achievement

    鍋島英知,井上克已

    情報処理学会論文誌   38 ( 3 )   462 - 471   1997.3

    　More details

    Language：Japanese  

▼display all

Books and Other Publications

  • データ構造とアルゴリズム

    岩沼 宏治 美濃 英俊 鍋島 英知 山本 泰生（ Role： Joint Work1,2,3章）

    コロナ社  2018.2  （  ISBN:978-4339018233 ）

    　More details

    Total pages：196   Responsible for pages：pp.4-70   Language：Japanese   Book type：Textbook, survey, introduction

    本書は,最近の動向に合わせて,機械学習的考え方,ビッグデータ的考え方,さらには擬似コードとC++実コードによるオブジェクト指向的考え方にも配慮しつつ,通常の学部用教科書としての側面もしっかりと押さえた教科書である。

Presentations

  • 解集合プログラミングを用いた看護師勤務表の自動生成と附属病院における評価

    菅原 孝太, 鍋島 英知

    スケジューリング・シンポジウム2023  2023.9  スケジューリング学会

    　More details

    Event date： 2023.9

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：大阪公立大学 I-siteなんば   Country：Japan  

  • SAT技術を用いた複数画像からなる視覚暗号の構成

    田光 宏章, 盧 暁南, 鍋島 英知

    電子情報通信学会 情報理論研究会  2023.8  電子情報通信学会 情報理論研究会

    　More details

    Event date： 2023.8

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：湘南工科大学   Country：Japan  

  • 解集合プログラミングを用いたハミルトン閉路遷移問題の解法

    平手貴大 番原睦則 井上克巳 盧暁南 鍋島英知 宋剛秀 田村直之

    第25回プログラミングおよびプログラミング言語ワークショップ (PPL 2023)  2023.3  日本ソフトウェア科学会 プログラミング論研究会

    　More details

    Event date： 2023.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：名古屋市  

  • 決定的並列SATソルバー構築のための汎用フレームワークの検討

    吹上 翼, 帯津 勇斗, 鍋島 英知, 盧 暁南

    第36回人工知能学会全国大会  2022.6  人工知能学会

    　More details

    Event date： 2022.6

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：京都国際会館＋オンライン  

  • 圧縮した SAT 問題における高速な単位伝播手法

    早瀬 悠真, 鍋島 英知, 盧 暁南

    第35回人工知能学会全国大会  2021.6  人工知能学会

    　More details

    Event date： 2021.6

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：オンライン  

  • 大規模な SAT 問題を圧縮したまま解くソルバーの開発

    早瀬 悠真, 鍋島 英知

    第34回人工知能学会全国大会  2020.6  人工知能学会

    　More details

    Event date： 2020.6

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：オンライン  

  • Studies on a Parallelization Method of SAT-based CSP Solvers using CEGAR and the Share of Counterexamples

    2020.3 

    　More details

    Event date： 2020.3

    Language：Japanese   Presentation type：Oral presentation(general)  

  • SATソルバーの動的対称性除去における候補削減手法

    市澤 拓美，原田 翔規，鍋島 英知

    人工知能学会 第109回 人工知能基本問題研究会  2019.3  人工知能学会

    　More details

    Event date： 2019.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：グラバー園 旧スチイル記念学校  

  • SAT ソルバーにおける学習節簡単化手法に基づくメタ探索戦略の提案

    中尾 陸，鍋島 英知

    人工知能学会 第109回 人工知能基本問題研究会  2019.3  人工知能学会

    　More details

    Event date： 2019.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：グラバー園 旧スチイル記念学校  

  • ポートフォリオ型並列 SAT ソルバーにおける適応型探索戦略

    神原 和裕，鍋島 英知

    人工知能学会 第109回 人工知能基本問題研究会  2019.3  人工知能学会

    　More details

    Event date： 2019.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：グラバー園 旧スチイル記念学校  

  • 決定的ポートフォリオ型並列SATソルバーの待ち時間削減による高速化手法

    後藤 優也, 鍋島 英知

    人工知能学会 第106回 人工知能基本問題研究会  2018.3  人工知能学会

    　More details

    Event date： 2018.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：指宿市民会館  

  • 研究室配属問題のCSP符号化手法の検討 Invited

    藤井 樹, 伊藤 靖展, 鍋島 英知

    第31回人工知能学会全国大会  2017.5  人工知能学会

    　More details

    Event date： 2017.5

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：ウインクあいち  

  • ポートフォリオ型SATソルバーのための分類器の構築手法

    藤江 柊輔, 鍋島 英知

    人工知能学会 第103回 人工知能基本問題研究会  2017.3  人工知能学会

    　More details

    Event date： 2017.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：湯布院公民館  

  • 同順位を含む研究室配属問題のCSPソルバーによる解法の検討

    藤井 樹, 伊藤 靖展, 鍋島 英知

    人工知能学会 第103回 人工知能基本問題研究会  2017.3  人工知能学会

    　More details

    Event date： 2017.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：湯布院公民館  

  • Recent Technical Trends of SAT Solvers Invited

    2016.6 

    　More details

    Event date： 2016.6

    Language：Japanese   Presentation type：Oral presentation(invited, special)  

  • 高速SATソルバーの実装と理論

    鍋島 英知

    第15回プログラミングおよびプログラミング言語ワークショップ  2013.3 

    　More details

    Event date： 2013.3

    Language：Japanese   Presentation type：Oral presentation(invited, special)  

    Venue：福島県会津若松 東山温泉 御宿東鳳  

  • 高速SATソルバーと産業問題への応用

    鍋島 英知

    平成23年度 山梨大学新技術情報クラブ 特別講演会  2011.12 

    　More details

    Event date： 2011.12

    Language：Japanese   Presentation type：Oral presentation(invited, special)  

    Venue：山梨大学  

  • GlueMiniSat 2.2.5：単位伝播を促す学習節の積極的獲得戦略に基づく高速SAT ソルバー

    鍋島 英知,岩沼 宏治,井上 克巳

    日本ソフトウェア科学会第28回大会  2011.9  日本ソフトウェア科学会

    　More details

    Event date： 2011.9

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：沖縄産業支援センター  

  • リテラルブロック距離に基づく良い学習節の評価と獲得による SAT ソルバの性能改善

    鍋島 英知,岩沼 宏治

    人工知能基本問題研究会 SIG-FPAI-B004  2011.1  人工知能学会

    　More details

    Event date： 2011.1

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：山梨  

  • 結論発見手続きSOLタブロー法のための多重探索戦略の提案

    鈴木 健士郎,鍋島 英知,岩沼 宏治

    人工知能基本問題研究会 SIG-FPAI-B003  2010.11  人工知能学会

    　More details

    Event date： 2010.11

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：東京  

  • 精度保証付きオンライン型高速系列データマイニング

    村田 順平,岩沼 宏治,石原 龍一,鍋島 英知

    第９回データマイニングと統計数理研究会 SIG-DMSM-A803  2009.3  人工知能学会

    　More details

    Event date： 2009.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：京都  

  • 長大な単一系列データにおける頻出飽和系列の高速マイニング

    村田 拓也,鍋島 英知,岩沼 宏治

    第９回データマイニングと統計数理研究会 SIG-DMSM-A803  2009.3  人工知能学会

    　More details

    Event date： 2009.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：京都  

  • 長大な単一系列データにおける頻出飽和系列の高速マイニング

    村田 拓也,岩沼 宏治,鍋島 英知

    第９回データマイニングと統計数理研究会 SIG-DMSM-A803  2009.3  人工知能学会

    　More details

    Event date： 2009.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：京都  

  • 並列分散型SATソルバにおける探索空間の分割手法の提案

    高見 明秀,鍋島 英知,岩沼 宏治

    電子情報通信学会技術研究報告 IEICE-SS-444  2009.3  電子情報通信学会

    　More details

    Event date： 2009.3

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：佐賀大学  

  • 情報量と頻度に基づく系列データマイニングにおける非同期パターンの抽出と効率化

    村田順平,岩沼宏治,大塚尚貴,鍋島英知

    第６回データマイニングと統計数理研究会 SIG-DMSM-A703  2008.2  人工知能学会

    　More details

    Event date： 2008.2

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：大阪大学中ノ島センター  

  • 因果関係抽出を目的としたコンフィデンスに基づく高速系列データマイニング

    市川博規,岩沼宏治,鍋島英知

    第68回人工知能学会人工知能基本問題研究会 SIG-FPAI-A703-12  2008.1  人工知能学会

    　More details

    Event date： 2008.1

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：北海道大学 百年記念会館  

  • イベント系列マイニングを目的とする新聞記事からの時系列情報に基づく単語抽出

    多田知道,岩沼宏治,鍋島英知

    第68回人工知能学会人工知能基本問題研究会 SIG-FPAI-A703-12  2008.1 

    　More details

    Event date： 2008.1

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：北海道大学 百年記念会館  

  • マルチコア環境に向けた高速並列SATソルバの開発

    高見明秀,鍋島英知,岩沼宏治

    第６回情報科学技術フォーラム  2007.9  情報処理学会，電子情報通信学会

    　More details

    Event date： 2007.9

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：中京大学 豊田キャンパス  

  • マルチコア環境向け並列SATソルバの開発

    高見明秀,鍋島英知,岩沼宏治

    電子情報通信学会技術研究報告 AI2007-2  2007.5  電子情報通信学会

    　More details

    Event date： 2007.5

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：機械振興会館  

  • Effective SAT Planning and SAT Scheduling by Lemma Reusing

    Hidetomo Nabeshima,Takehide Soh,Katsumi Inoue,Koji Iwanuma

    電子情報通信学会技術報告 AI2006-1～11  2006.5  電子情報通信学会

    　More details

    Event date： 2006.5

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：機械振興会館  

  • 精錬手法に基づく検索隠し味型専門検索エンジンの半自動生成

    鈴木悠生,鍋島英知,岩沼宏治

    第４回情報科学技術フォーラム  2005.9  情報処理学会，電子情報通信学会

    　More details

    Event date： 2005.9

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：中央大学後楽園キャンパス  

  • 検索隠し味の半自動生成を目的とした訓練データの精製

    鈴木悠生,鍋島英知,岩沼宏治

    電子情報通信学会技術研究報告 AI2005-1～6  2005.5  電子情報通信学会

    　More details

    Event date： 2005.5

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：機械振興会館  

  • 単一の長大なテキストデータ系列からの頻出パターンの発見

    高野洋,鍋島英知,岩沼宏治

    人工知能学会 ことば研究会資料 SIG-LSE-A401  2004.7  人工知能学会

    　More details

    Event date： 2004.7

    Language：Japanese   Presentation type：Oral presentation(general)  

    Venue：山梨大学  

  • 補題再利用によるSATプラニングの高速化

    鍋島英知,野沢宏仁,岩沼宏治

    電子情報通信学会技術研究報告 AI2003-9  2003.4 

    　More details

    Event date： 2003.4

    Language：Japanese   Presentation type：Oral presentation(general)  

  • 投機的計算によるSATプランニングの効率改善に関する研究

    鍋島英知，岩沼宏治

    電子情報通信学会技術研究報告「人工知能と知識処理」  2002.5 

    　More details

    Event date： 2002.5

    Language：Japanese   Presentation type：Oral presentation(general)  

▼display all

The total number of announcement other than the above

  • 2023

    Total number of non-preannounced events：2  Number of main presenters：2  Number of presenters other than main person：0

  • 2016

    Total number of non-preannounced events：4  Number of main presenters：0  Number of presenters other than main person：4

  • 2015

    Total number of non-preannounced events：3  Number of main presenters：0  Number of presenters other than main person：3

  • 2014

    Total number of non-preannounced events：5  Number of main presenters：0  Number of presenters other than main person：5

  • 2013

    Total number of non-preannounced events：2  Number of main presenters：0  Number of presenters other than main person：2

  • 2012

    Total number of non-preannounced events：3  Number of main presenters：0  Number of presenters other than main person：3

  • 2011

    Total number of non-preannounced events：9  Number of main presenters：0  Number of presenters other than main person：9

  • 2010

    Total number of non-preannounced events：8  Number of main presenters：4  Number of presenters other than main person：4

  • 2009

    Total number of non-preannounced events：5  Number of main presenters：3  Number of presenters other than main person：2

  • 2008

    Total number of non-preannounced events：2  Number of main presenters：0  Number of presenters other than main person：2

  • 2007

    Total number of non-preannounced events：1  Number of main presenters：1  Number of presenters other than main person：0

  • 2006

    Total number of non-preannounced events：6  Number of main presenters：0  Number of presenters other than main person：6

  • 2005

    Total number of non-preannounced events：8  Number of main presenters：0  Number of presenters other than main person：8

  • 2004

    Total number of non-preannounced events：5  Number of main presenters：0  Number of presenters other than main person：5

  • 2003

    Total number of non-preannounced events：5  Number of main presenters：0  Number of presenters other than main person：5

  • 2002

    Total number of non-preannounced events：5  Number of main presenters：0  Number of presenters other than main person：5

  • 2001

    Total number of non-preannounced events：6  Number of main presenters：0  Number of presenters other than main person：6

▼display all

Industrial Property Rights

  • 防犯・防災監視システム

    石田鉄広,安福逸雄,砂川義人,鍋島英知

    　More details

    Application no：特許出願平10-164527  Date applied：1998.6

    Patent/Registration no：398029429 

    Country of applicant：Domestic  

Awards

  • XCSP3 Competition Main CSP Track 2nd place

    2023.9   XCSP3 Competition 2023   Fun-sCOP

    Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Naoyuki Tamura

    　More details

    Award type：Award from international society, conference, symposium, etc. 

  • The 2nd and 3rd places in Parallel track at SAT competition 2022. The 2nd prize in SAT+UNSAT Application category at SAT competition 2011. The 2nd prize in UNSAT Application category of multicore track at SAT competition 2011.

    2022.8   SAT 2022 Competition  

    　More details

    Award type：Award from international society, conference, symposium, etc. 

  • 人工知能学会全国大会優秀賞

    2020.11   人工知能学会   大規模な SAT 問題を圧縮したまま解くソルバーの開発

    早瀬 悠真，鍋島 英知

    　More details

    Award type：Award from Japanese society, conference, symposium, etc. 

  • ⼈⼯知能学会研究会優秀賞

    2017.6   人工知能学会   同順位を含む研究室配属問題のCSPソルバーによる解法の検討

    藤井 樹，伊藤 靖展，鍋島 英知

  • 日本ソフトウェア科学会第3回ソフトウェア論文賞

    2014.9   日本ソフトウェア科学会  

    鍋島 英知

    　More details

    GlueMiniSat 2.2.5: 単位伝搬を促す学習節の積極的獲得戦略に基づく高速SAT ソルバー

  • The 2nd prize in certified UNSAT Application category at SAT competition 2013.

    2013.7   SAT 2013 Competition  

  • 第１８回山梨科学アカデミー奨励賞

    2013.5   山梨科学アカデミー  

    鍋島 英知

    　More details

    鍋島らは，計算機科学における基本問題の1つである命題論理における充足可能性判定(SAT)と，自動推論の基盤となる一階論理における結論発見に関して，優れたソフトウェアを開発している．前者ではソルバーの性能を競う国際競技会で部門別優勝するなど大きな成果を挙げており，後者では効率的に結論を発見するシステムSOLARを構築し，国内外の様々な研究課題の推論エンジンとして利用されている．

  • 日本ソフトウェア科学会第28回大会高橋奨励賞

    2012.8   日本ソフトウェア科学会  

    鍋島 英知

    　More details

    受賞の対象となった研究発表は「GlueMiniSat2.2.5: 単位伝搬を促す学習節の積極的獲得戦略に基づく高速SATソルバー」であり，情報科学で最も基本的で本質的な組合せ問題である命題論理の充足可能性判定問題 (SAT問題) を高速に解くソルバーを開発したことが顕著な成果として認められた．

  • The winner in UNSAT Application category at SAT competition 2011. The 2nd prize in SAT+UNSAT Application category at SAT competition 2011. The 2nd prize in UNSAT Application category of multicore track at SAT competition 2011.

    2011.6   SAT 2011 Competition  

  • Best Student Paper Award (BIOINFORMATICS 2011)

    2011.1   International Conference on Bioinformatics Models, Methods and Algorithms  

    Gabriel Synnaeve,Katsumi Inoue,Andrei Doncescu,Hidetomo Nabeshima,Yoshitaka Kameya,Masakazu Ishihata,Taisuke Sato

    　More details

    Kinetic Models and Qualitative Abstraction for Relational Learning in Systems Biology, Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS 2011)

  • 第３回情報科学技術フォーラム(FIT2004)優秀論文賞

    2004.9   電子情報通信学会，情報処理学会  

    高野洋,岩沼宏治,鍋島英知

    　More details

    高野洋，岩沼宏治，鍋島英知：単一の長大なデータ系列上の系列パターンの出現尺度とその逆単調性，第３回情報科学技術レターズ, LF-012, pp.115-118

▼display all

Teaching Experience (On-campus)

  • Software Development Projects I Major achievement

    2023Year  Type of subject：Professional education (undergraduate)

  • Formal Languages and Compilers Major achievement

    2023Year  Type of subject：Professional education (undergraduate)

  • Advanced Programming Major achievement

    2023Year  Type of subject：Professional education (undergraduate)

  • Large-scale Discrete Structure Processing Major achievement

    2023Year  Type of subject：Master's (Graduate School)

  • Software Development Projects I Major achievement

    2021Year

  • Formal Languages and Compilers Major achievement

    2021Year  Type of subject：Professional education (undergraduate)

  • Advanced Programming Major achievement

    2021Year

  • Large-scale Discrete Structure Processing Major achievement

    2021Year  Type of subject：Master's (Graduate School)

  • 大規模離散構造特論 Major achievement

    2017Year  Type of subject：Master's (Graduate School)

  • 形式言語とコンパイラ Major achievement

    2017Year  Type of subject：Professional education (undergraduate)

  • プログラミング応用 Major achievement

    2017Year  Type of subject：Professional education (undergraduate)

  • ソフトウェア設計開発演習I Major achievement

    2017Year  Type of subject：Professional education (undergraduate)

  • Formal Languages and Compilers Major achievement

    2015Year  Type of subject：Professional education (undergraduate)

  • Software Design and Development Projects I Major achievement

    2015Year  Type of subject：Professional education (undergraduate)

  • Programming Advance Major achievement

    2015Year  Type of subject：Professional education (undergraduate)

  • Artificial Intelligence

    2014Year  Type of subject：Professional education (undergraduate)

  • Formal Languages and Compilers

    2014Year  Type of subject：Professional education (undergraduate)

  • Software Design and Development Projects I

    2014Year  Type of subject：Professional education (undergraduate)

  • Programming Advance

    2014Year  Type of subject：Professional education (undergraduate)

  • Formal Languages and Automata

    2013Year  Type of subject：Professional education (undergraduate)

  • Programming Advance

    2013Year  Type of subject：Professional education (undergraduate)

  • Artificial Intelligence

    2013Year  Type of subject：Professional education (undergraduate)

  • Artificial Intelligence Laboratory

    2013Year  Type of subject：Professional education (undergraduate)

  • Programming II

    2012Year  Type of subject：Professional education (undergraduate)

  • Formal Languages and Automata

    2012Year  Type of subject：Professional education (undergraduate)

  • Artificial Intelligence Laboratory

    2012Year  Type of subject：Professional education (undergraduate)

  • Artificial Intelligence

    2012Year  Type of subject：Professional education (undergraduate)

  • Programming II

    2011Year  Type of subject：Professional education (undergraduate)

  • Programming II Laboratory

    2011Year  Type of subject：Professional education (undergraduate)

  • Formal Languages and Automata

    2011Year  Type of subject：Professional education (undergraduate)

  • Artificial Intelligence Laboratory

    2011Year  Type of subject：Professional education (undergraduate)

  • Artificial Intelligence

    2011Year  Type of subject：Professional education (undergraduate)

  • プログラミングII演習

    2010Year  Type of subject：Professional education (undergraduate)

  • 人工知能演習

    2010Year  Type of subject：Professional education (undergraduate)

  • コンピュータネットワーク実習

    2010Year  Type of subject：Professional education (undergraduate)

  • 人工知能

    2010Year  Type of subject：Professional education (undergraduate)

  • プログラミングII

    2010Year  Type of subject：Professional education (undergraduate)

  • コンピュータネットワーク実習

    2009Year  Type of subject：Professional education (undergraduate)

  • 人工知能演習

    2009Year  Type of subject：Professional education (undergraduate)

  • 人工知能

    2009Year  Type of subject：Professional education (undergraduate)

  • プログラミングII

    2009Year  Type of subject：Professional education (undergraduate)

  • プログラミングII演習

    2009Year  Type of subject：Professional education (undergraduate)

  • 信号処理演習

    2008Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア卒業論文

    2008Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学研修

    2008Year  Type of subject：Professional education (undergraduate)

  • メディア工学概論

    2008Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学入門ゼミ

    2008Year  Type of subject：Professional education (undergraduate)

  • コンピュータネットワーク実習

    2008Year  Type of subject：Professional education (undergraduate)

  • 人工知能演習

    2008Year  Type of subject：Professional education (undergraduate)

  • アルゴリズムとデータ構造演習

    2008Year  Type of subject：Professional education (undergraduate)

  • コンピュータネットワーク実習

    2007Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学入門ゼミ

    2007Year  Type of subject：Professional education (undergraduate)

  • メディア工学概論

    2007Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学研修

    2007Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア卒業論文

    2007Year  Type of subject：Professional education (undergraduate)

  • アルゴリズムとデータ構造演習

    2007Year  Type of subject：Professional education (undergraduate)

  • 人工知能演習

    2007Year  Type of subject：Professional education (undergraduate)

  • メディア工学概論

    2006Year  Type of subject：Professional education (undergraduate)

  • コンピュータネットワーク実習

    2006Year  Type of subject：Professional education (undergraduate)

  • 人工知能演習

    2006Year  Type of subject：Professional education (undergraduate)

  • アルゴリズムとデータ構造演習

    2006Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア卒業論文

    2006Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学入門ゼミ

    2006Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学研修

    2006Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学研修

    2005Year  Type of subject：Professional education (undergraduate)

  • 人工知能演習

    2005Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア卒業論文

    2005Year  Type of subject：Professional education (undergraduate)

  • メディア工学概論

    2005Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学入門ゼミ

    2005Year  Type of subject：Professional education (undergraduate)

  • コンピュータネットワーク実習

    2005Year  Type of subject：Professional education (undergraduate)

  • アルゴリズムとデータ構造演習

    2005Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学研修

    2004Year  Type of subject：Professional education (undergraduate)

  • メディア工学概論

    2004Year  Type of subject：Professional education (undergraduate)

  • メディア工学演習

    2004Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学入門ゼミ

    2004Year  Type of subject：Professional education (undergraduate)

  • 信号処理演習

    2004Year  Type of subject：Professional education (undergraduate)

  • コンピュータネットワーク実習

    2004Year  Type of subject：Professional education (undergraduate)

  • 人工知能演習

    2004Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア卒業論文

    2004Year  Type of subject：Professional education (undergraduate)

  • メディア工学演習

    2003Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学入門ゼミ

    2003Year  Type of subject：Professional education (undergraduate)

  • 情報処理及び実習

    2003Year  Type of subject：Professional education (undergraduate)

  • 信号処理演習

    2003Year  Type of subject：Professional education (undergraduate)

  • オペレーティングシステム演習

    2003Year  Type of subject：Professional education (undergraduate)

  • ネットワーク構築シミュレーション及び実習

    2003Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア卒業論文

    2003Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学研修

    2003Year  Type of subject：Professional education (undergraduate)

  • メディア工学概論

    2003Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学入門ゼミ

    2002Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア卒業論文

    2002Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学研修

    2002Year  Type of subject：Professional education (undergraduate)

  • 情報処理及び実習

    2002Year  Type of subject：Professional education (undergraduate)

  • ネットワーク構築シミュレーション及び実習

    2002Year  Type of subject：Professional education (undergraduate)

  • メディア工学概論

    2002Year  Type of subject：Professional education (undergraduate)

  • メディア工学演習

    2002Year  Type of subject：Professional education (undergraduate)

  • 基礎アルゴリズムおよび実習

    2001Year  Type of subject：Professional education (undergraduate)

  • ネットワーク構築シミュレーション及び実習

    2001Year  Type of subject：Professional education (undergraduate)

  • 情報処理及び実習

    2001Year  Type of subject：Professional education (undergraduate)

  • メディア工学演習

    2001Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア卒業論文

    2001Year  Type of subject：Professional education (undergraduate)

  • コンピュータ・メディア工学研修

    2001Year  Type of subject：Professional education (undergraduate)

▼display all

Textbooks and teaching materials

  • データ構造とアルゴリズム

     2018.02.01

    Total number of pages：196

Professional Memberships

  • Japan Society for Software Science and Technology

    2011.11

  • The Institute of Electronics, Information and Communication Engineers

    2005.4

  • The Japanese Society for Artificial Intelligence

    1997.11

Committee Memberships

  • Pragmatics of SAT 2020   Program committee  

    2020.3 - 2024.3   

  • 人工知能学会人工知能基本問題研究会   幹事  

    2010.4 - 2012.3   

  • 情報処理学会 プログラミング研究運営委員会   運営委員  

    2008.4 - 2013.3   

  • 電子情報通信学会 人工知能と知識処理研究専門委員会   専門委員  

    2007.5 - 2013.5   

  • 電子情報通信学会 人工知能と知識処理研究専門委員会   幹事補佐  

    2005.5 - 2007.5