Updated on 2025/03/03

Information

 

写真a

 
KOSHIMURA MIYUKI
 
Organization
Faculty of Information Science and Electrical Engineering Department of Informatics Assistant Professor
School of Engineering Department of Electrical Engineering and Computer Science（Concurrent）
Graduate School of Information Science and Electrical Engineering Department of Information Science and Technology（Concurrent）
School of Sciences Department of Physics（Concurrent）
Title
Assistant Professor
Profile
これまでに並列オぺレーティングシステム，定理証明システムの研究及び開発に従事． 現在は，SATソルバーの高速化とSATの応用に関する研究を行っている． 研究室のサーバ類の管理・運用を行っている．
Homepage
External link

Degree

  • Doctor of Engineering

Research History

  • National Institute of Advanced Industrial Science and Technology  招聘研究員 

    2020.4 - Present

    　 More details

    Country：Japan

    researchmap

  • Seinan Gakuin University Department of Human Sciences 非常勤講師 

    2015.4 - 2024.2

    　 More details

  • - 九州大学大学院システム情報科学研究院 助教   

    2007 - Present

    　 More details

  • 東芝情報システム(株) 1986.4〜1995.3   

    東芝情報システム(株) 1986.4〜1995.3

Research Interests・Research Keywords

  • Research theme： Automated Reasoing

    Keyword： Automated Reasoing

    Research period： 2024

  • Research theme： SAT

    Keyword： SAT

    Research period： 2024

  • Research theme： Scheduling

    Keyword： Scheduling

    Research period： 2024

  • Research theme： Coalition Structure Generation Problem

    Keyword： Coalition Structure Generation Problem

    Research period： 2024

  • Research theme： Automated Reasoning and its Applications

    Keyword： model generation, non-monotonic logic, efficiency of inference, verification

    Research period： 1995.4

  • Research theme： Parallel Operating System

    Keyword： parallel inference machine, parallel OS

    Research period： 1986.11 - 1990.3

Awards

  • ISC(International Supercomputing Conference) Award

    2007.6   ISC Award Committee   ISC'07への投稿論文 Satoshi AMAMIYA, Ryuzo HASEGAWA, Hiroshi FUJITA, Miyuki KOSHIMURA, Ryo HIRANA and Makoto AMAMIYA, "A Language Design for Non-Interruptable Multithreading Environment Fuce" がAward Winning Paperの一つに選ばれた． 発表者１名の渡航費用と会議参加費が免除．また賞金5千ユーロが授与された．

Papers

  • 垂直搬送機のスケジューリング問題に対するMaxSAT の適用 Reviewed

    岡本 和也, 小出 幸和, @越村 三幸, 野田 五十樹

    人工知能学会論文誌   39 ( 2 )   2024.3

    　More details

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

    DOI： https://doi.org/10.1527/tjsai.39-2_B-N64

  • Concise integer linear programming formulation for clique partitioning problems Reviewed International journal

    Miyuki Koshimura, #Emi Watanabe, Yuko Sakurai, Makoto Yokoo

    CONSTRAINTS   27 ( 1-2 )   99 - 115   2022.4   （ ISSN:1383-7133 eISSN:1572-9354 ）

    　More details

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

    A Clique Partitioning Problem (CPP) finds an optimal partition of a given edge-weighted undirected graph, such that the sum of the weights is maximized. This general graph problem has a wide range of real-world applications, including correlation clustering, group technology, community detection, and coalition structure generation. Although a CPP is NP-hard, due to the recent advance of Integer Linear Programming (ILP) solvers, we can solve reasonably large problem instances by formulating a CPP as an ILP instance. The first ILP formulation was introduced by Grötschel and Wakabayashi (Mathematical Programming, 45(1-3), 59–96, 1989). Recently, Miyauchi et al. (2018) proposed a more concise ILP formulation that can significantly reduce transitivity constraints as compared to previously introduced models. In this paper, we introduce a series of concise ILP formulations that can reduce even more transitivity constraints. We theoretically evaluate the amount of reduction based on a simple model in which edge signs (positive/negative) are chosen independently. We show that the reduction can be up to 50% (dependent of the ratio of negative edges) and experimentally evaluate the amount of reduction and the performance of our proposed formulation using a variety of graph data sets. Experimental evaluations show that the reduction can exceed 50% (where edge signs can be correlated), and our formulation outperforms the existing state-of-the-art formulations both in terms of memory usage and computational time for most problem instances.

    DOI： 10.1007/s10601-022-09326-z

    Web of Science

    Scopus

    researchmap

  • A Simple yet Efficient MCSes Enumeration with SAT Oracles Reviewed International journal

    Miyuki Koshimura, @Ken Satoh

    12th Asian Conference on Intelligent Information and Database Systems   Part I   191 - 201   2020.3

    　More details

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

    DOI： 10.1007/978-3-030-41964-6_17

  • N-level Modulo-Based CNF encodings of Pseudo-Boolean constraints for MaxSAT Reviewed

    #Aolong Zha, Miyuki Koshimura, Hiroshi Fujita

    Constraints   24 ( 2 )   133 - 161   2019.4

    　More details

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

    Many combinatorial problems in various fields can be translated to Maximum Satisfiability (MaxSAT) problems. Although the general problem is NP-hard, more and more practical problems may be solved due to the significant effort which has been devoted to the development of efficient solvers. The art of constraints encoding is as important as the art of devising algorithms for MaxSAT. In this paper, we present several encoding methods of pseudo-Boolean constraints into Boolean satisfiability problems in Conjunctive Normal Form (CNF) formula, which are based on the idea of modular arithmetic and only generate auxiliary variables for each unique combination of weights. These techniques are efficient in encoding and solving MaxSAT problems. In particular, our solvers won the partial MaxSAT industrial category from 2010 through 2012 and ranked second in the 2017 main weighted track of the MaxSAT evaluation. We prove the correctness and the pseudo-polynomial space complexity of our encodings and also give a heuristics of the base selection for modular arithmetic. Our experimental results show that our encoding compactly encodes the constraints, and the obtained clauses are efficiently handled by a state-of-the-art SAT solver.

    DOI： 10.1007/s10601-018-9299-0

  • Improved WPM encoding for coalition structure generation under MC-nets Reviewed International journal

    @Xiaojuan Liao, Miyuki Koshimura, #Kazuki Nomoto, @Suguru Ueda, @Yuko Sakurai, Makoto Yokoo

    Constraints   24 ( 1 )   25 - 55   2019.1

    　More details

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

    The Coalition Structure Generation (CSG) problem plays an important role in the domain of coalition games. Its goal is to create coalitions of agents so that the global welfare is maximized. To date, Weighted Partial MaxSAT (WPM) encoding has shown high efficiency in solving the CSG problem, which encodes a set of constraints into Boolean propositional logic and employs an off-the-shelf WPM solver to find out the optimal solution. However, in existing WPM encodings, a number of redundant encodings are asserted. This results in additional calculations and correspondingly incurs performance penalty. Against this background, this paper presents an Improved Rule Relation-based WPM (I-RWPM) encoding for the CSG problem, which is expressed by a set of weighted rules in a concise representation scheme called Marginal Contribution net (MC-net). In order to effectively reduce the constraints imposed on encodings, we first identify a subset of rules in an MC-net, referred as a set of freelance rules. We prove that solving the problem made up of all freelance rules can be achieved with a straightforward means without any extra encodings. Thus the set of rules requiring to be encoded is downsized. Next, we improve the encoding of transitive relations among rules. To be specific, compared with the existing rule relation-based encoding that generates transitive relations universally among all rules, I-RWPM only considers the transitivity among rules with particular relationship. In this way, the number of constraints to be encoded can be further decreased. Experiments suggest that I-RWPM significantly outperforms other WPM encodings for solving the same set of problem instances.
    提携構造形成問題（CSG)は協力ゲーム理論の問題の一つで、エージェント集合を社会的効用が最大となるように分割する問題である． 我々は以前、CSGをMaxSAT符号化して解く解法を示した． この解法は従来の混合整数計画法を利用する手法より桁違いに速い． 本論文では、このMaxSAT符号化による制約数を削減する手法を提案した． そして理論的には、制約数を少なくとも1/4以下に削減できることを示した． 計算機実験では、エージェント数が３００の時、制約数は１０の７乗超から１０の５乗程度に削減、計算時間は１００秒超から１０秒以内に短縮できた．

    DOI： 10.1007/s10601-018-9295-4

  • Extending MaxSAT to Solve the Coalition Structure Generation Problem with Externalities Based on Agent Relations Reviewed International journal

    Xiaojuan Liao, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa

    IEICE TRANSACTIONS on Information and Systems   E97-D ( 7 )   1812 - 1821   2014.7

    　More details

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

    Coalition Structure Generation (CSG) means partitioning agents into exhaustive and disjoint coalitions so that the sum of values of all the coalitions is maximized. Solving this problem could be facilitated by employing some compact representation schemes, such as marginal contribution network (MC-net). In MC-net, the CSG problem is represented by a set of rules where each rule is associated with a real-valued weights, and the goal is to maximize the sum of weights of rules under some constraints. This naturally leads to a combinatorial optimization problem that could be solved with weighted partial MaxSAT (WPM). In general, WPM deals with only positive weights while the weights involved in a CSG problem could be either positive or negative. With this in mind, in this paper, we propose an extension of WPM to handle negative weights and take advantage of the extended WPM to solve the MC-net-based CSG problem. Specifically, we encode the relations between each pair of agents and reform the MC-net as a set of Boolean formulas. Thus, the CSG problem is encoded as an optimization problem for WPM solvers. Furthermore, we apply this agent relation-based WPM with minor revision to solve the extended CSG problem where the value of a coalition is affected by the formation of other coalitions, a coalition known as externality. Experiments demonstrate that, compared to the previous encoding, our proposed method speeds up the process of solving the CSG problem significantly, as it generates fewer number of Boolean variables and clauses that need to be examined by WPM solver.

    DOI： 10.1587/transinf.E97.D.1812

  • Solving the Coalition Structure Generation Problem with MaxSAT Reviewed International journal

    Xiaojuan Liao, Miyuki Koshimura, RYUZO HASEGAWA

    24th International Conference on Tools with Artificial Intelligence   910 - 915   2012.12

    　More details

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

  • QMaxSAT: A Partial Max-SAT Solver Reviewed International journal

    Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, and Ryuzo Hasegawa

    Journal on Satisfiability, Boolean Modeling and Computation   8   2012.1

    　More details

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

    We present a partial Max-SAT solver \QMaxSAT which
    uses CNF encoding of Boolean cardinality constraints.
    The old version 0.1 was obtained by
    adapting a CDCL based SAT solver MiniSat to manage cardinality constraints.
    It was placed first in the industrial subcategory and second in the crafted
    subcategory of partial Max-SAT category of the 2010 Max-SAT Evaluation.

    The new version 0.2 is obtained by modifying version 0.1 to
    decrease the number of clauses for the cardinality encoding.
    We compare the two versions by solving Max-SAT instances taken
    from the 2010 Max-SAT Evaluation.

  • QMaxSAT version 0.3 & 0.4 Reviewed International journal

    Xuanye An, Miyuki Koshimura, Hiroshi Fujita and Ryuzo Hasegawa

    International Workshop on First-Order Theorem Proving (FTP)   2011.7

    　More details

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

  • Solving open job-shop scheduling problems by SAT encoding Reviewed International journal

    Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa

    IEICE Transactions on Information and Systems   E93-D ( 8 )   2316 - 2318   2010.1

    　More details

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

    This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating them into Boolean Satisfiability Testing Problems (SAT). The encoding method is essentially the same as the one proposed by Crawford and Baker. The open problems are ABZ8, ABZ9, YN1, YN2, YN3, and YN4. We proved that the best known upper bounds 678 of ABZ9 and 884 of YN1 are indeed optimal. We also improved the upper bound of YN2 and lower bounds of ABZ8, YN2, YN3 and YN4.

    DOI： 10.1587/transinf.E93.D.2316

  • Minimal model generation with respect to an atom set Reviewed International journal

    Miyuki Koshimura, Hidetomo Nabeshima, Hiroshi Fujita, Ryuzo Hasegawa

    7th International Workshop on First-Order Theorem Proving, FTP 2009 CEUR Workshop Proceedings   556   49 - 59   2009.12

    　More details

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

    This paper studies minimal model generation for SAT instances. In this study, we minimize models with respect to an atom set, and not to the whole atom set. In order to enumerate minimal models, we use an arbitrary SAT solver as a subroutine which returns models of satisfiable SAT instances. In this way, we benefit from the year-byyear progress of efficient SAT solvers for generating minimal models. As an application, we try to solve job-shop scheduling problems by encoding them into SAT instances whose minimal models represent optimum solutions.

  • 抽象モデル生成による不要節の削除 Reviewed

    梅田 眞由美，越村 三幸，長谷川 隆三

    電子情報通信学会論文誌D   J89-D ( 10 )   2006.10

    　More details

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

  • Abstract Model Generation for Preprocessing Clause Sets Reviewed International journal

    Miyuki Koshimura, Mayumi Umeda, Ryuzo Hasegawa

    Proc. of LPAR2004   3452   67 - 78   2005.3

    　More details

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

  • Minimal Model Generation with Factorization and Constrained Search Reviewed

    Miyuki Koshimura, Megumi Iwaki, and Ryuzo Hasegawa

    情報処理学会論文誌   44 ( 4 )   2003.4

    　More details

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

  • 深さ優先ノンホーンマジックセット法の完全性証明

    越村 三幸，長谷川 隆三

    九州大学大学院システム情報科学紀要   2002.9

    　More details

    Language：Japanese  

  • Model Generation with Boolean Constraints Reviewed International journal

    Miyuki Koshimura, Ryuzo Hasegawa

    Proc. of LPAR2001   2001.12

    　More details

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

  • 幅優先ノンホーンマジックセット法の完全性の証明とその応用 Reviewed

    越村 三幸、長谷川 隆三

    情報処理学会論文誌   42 ( 9 )   2001.9

    　More details

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

  • 分岐補題の抽出による極小モデル生成の効率化 Reviewed

    長谷川 隆三、藤田 博、越村 三幸

    人工知能学会論文誌   16 ( 2 )   2001.3

    　More details

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

  • Proof Simplification for Model Generation and Its Applications Reviewed International journal

    Miyuki Koshimura, Ryuzo Hasegawa

    Proc. of LPAR2000   1955   96 - 113   2000.11

    　More details

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

    DOI： 10.1007/3-540-44404-1_8

  • 証明の依存性解析によるモデル生成法の冗長探索の削除 Reviewed

    越村 三幸、長谷川 隆三

    人工知能学会誌   15 ( 6 )   2000.11

    　More details

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

  • ノンホーン・マジックセット変換節数削減手法とその評価

    越村 三幸，長谷川 隆三，田中 智浩

    九州大学大学院システム情報科学研究科報   1997.9

    　More details

    Language：Japanese  

  • A Method to Eliminate Redundant Case-Splittings in MGTP Reviewed International journal

    Miyuki Koshimura, Takashi Matsumoto, Hiroshi Fujita and Ryuzo Hasegawa

    IJCAI-97 Workshop on Model Based Automated Reasonging   1997.8

    　More details

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

  • MGTP: A Model Generation Theorem Prover - Its Advanced Features and Applications - Invited International journal

    Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

    Proc. of TABLEAUX'97   1227   1 - 15   1997.5

    　More details

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

  • ボトムアップ定理証明器の効率的アルゴリズムとその評価 Reviewed

    長谷川 隆三，越村 三幸，藤田 博

    情報処理学会論文誌   36 ( 3 )   1995.3

    　More details

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

  • モデル生成型定理証明系のAND並列化方式 Reviewed

    越村 三幸，長谷川 隆三

    電子情報通信学会論文誌 D-I   J78-D-I ( 2 )   1995.2

    　More details

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

  • An AND Parallelization Method for MGTP and Its Evaluation Reviewed International journal

    Ryuzo Hasegawa, Miyuki Koshimura

    Proc. of PASCO'94   1994.9

    　More details

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

  • Modal Propositional Tableaux in a Model Generation Theorem Prover Reviewed International journal

    Miyuki Koshimura, Ryuzo Hasegawa

    Proc. of TABLEAUX-'94   1994.5

    　More details

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

  • MGTP: A Parallel Theorem Prover Based on Lazy Model Generation Reviewed International journal

    Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita

    Proc. of CADE-11   1992.6

    　More details

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

  • Model Generation Theorem Provers on a Parallel Inference Machine Reviewed International journal

    Masayuki Fujita, Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita

    Proc. of FGCS'92   1992.6

    　More details

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

  • PIMOSの資源管理方式 Reviewed

    佐藤 裕幸，越村 三幸，近山 隆，藤瀬 哲朗，松尾 正治，和田 久美子

    情報処理学会論文誌   30 ( 12 )   1989.12

    　More details

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

  • An Improvement of MaxSAT Encoding for Coalition Structure Generation with Externaliies

    KINOSHITA Haruto, SAKURAI Yuko, KOSHIMURA Miyuki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2024 ( 0 )   2M4OS11b04 - 2M4OS11b04   2024   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>The Coalition Structure Generation (CSG) problem involves dividing the set of agents to maximize the sum of coalition values, and various algorithms have been proposed to address it. We propose an improvement that enables more efficient solving of the CSG problem, where externalities exist between coalitions, compared to the conventional MaxSAT encoding. Computational experiments demonstrate that our approach can reduce CPU computation time compared to traditional methods.</p>

    DOI： 10.11517/pjsai.jsai2024.0_2m4os11b04

    CiNii Research

  • Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS Reviewed International journal

    @Xiaojuan Liao, @Hui Zhang, Miyuki Koshimura, @Rong Huang, @Fagen Li

    Journal of Universal Computer Science   2023.8

    　More details

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

    DOI： https://doi.org/10.3897/jucs.97743

  • Robust Weighted Partial Maximum Satisfiability Problem: Challenge to Sigma2P-Complete Problem Reviewed International journal

    Tomoya Sugahara, Kaito Yamashita, Nathanaël Barrot, Miyuki Koshimura, Makoto Yokoo

    PRICAI 2022: Trends in Artificial Intelligence - 19th Pacific Rim International Conference on Artificial Intelligence   13629   17 - 31   2022.11   （ ISSN:0302-9743 ISBN:978-3-031-20861-4 eISSN:1611-3349 ）

    　More details

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

    This paper introduces a new problem called the Robust Maximum Satisfiability problem (R-MaxSAT), as well as its extension called the Robust weighted Partial MaxSAT (R-PMaxSAT). In R-MaxSAT (or R-PMaxSAT), a problem solver called defender hopes to maximize the number of satisfied clauses (or the sum of their weights) as the standard MaxSAT/partial MaxSAT problem, although she must ensure that the obtained solution is robust (In this paper, we use the pronoun “she” for the defender and “he” for the attacker). We assume an adversary called the attacker will flip some variables after the defender selects a solution. R-PMaxSAT can formalize the robust Clique Partitioning Problem (robust CPP), where CPP has many real-life applications. We first demonstrate that the decision version of R-MaxSAT is Σ2P -complete. Then, we develop two algorithms to solve R-PMaxSAT, by utilizing a state-of-the-art SAT solver or a Quantified Boolean Formula (QBF) solver as a subroutine. Our experimental results show that we can obtain optimal solutions within a reasonable amount of time for randomly generated R-MaxSAT instances with 30 variables and 150 clauses (within 40 s) and R-PMaxSAT instances based on CPP benchmark problems with 60 vertices (within 500 s).

    DOI： 10.1007/978-3-031-20862-1_2

    Web of Science

    Scopus

    researchmap

    Other Link： https://dblp.uni-trier.de/db/conf/pricai/pricai2022-1.html#SugaharaYBKY22

  • Impossibility of weakly stable and strategy-proof mechanism Reviewed International journal

    #Sung-Ho Cho, Miyuki Koshimura, Pink Mandal, #Kentaro Yahiro, Makoto Yokoo

    Economics Letters   217   2022.6

    　More details

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

    DOI： https://doi.org/10.1016/j.econlet.2022.110675

    Other Link： https://doi.org/10.1016/j.econlet.2022.110675

  • R-MaxSAT : MaxSAT with adversary

    YAMASHITA Kaito, SUGAHARA Tomoya, KOSHIMURA Miyuki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2022 ( 0 )   4F1OS8a04 - 4F1OS8a04   2022

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>This paper presents a new problem called Robust weighted Partial Maximum Satisfiability (R-PMaxSAT), which is an extension of Robust MaxSAT (R-MaxSAT) whose decision version is Sigma2P-complete. In R-MaxSAT (or R-PMaxSAT), a problem solver called the defender expects to maximize the number of satisfied clauses (or the sum of their weights) as a standard MaxSAT, although the obtained solution must be robust. We presume an adversary called the attacker will modify some variables after the defender decides a solution. R-PMaxSAT can formalize a robust Clique Partitioning Problem (robust CPP), where CPP has many real-life applications. Then, we introduce two algorithms to solve R-PMaxSAT, by utilizing a modern SAT solver or a QBF solver as a subroutine. Our experimental results show that we can obtain optimal solutions within reasonable time for randomly generated R-MaxSAT instances and robust CPP instances based on CPP benchmark problems.</p>

    DOI： 10.11517/pjsai.jsai2022.0_4f1os8a04

    CiNii Research

  • Modeling and Solving Scheduling in Overloaded Situations with Weighted Partial MaxSAT Reviewed International journal

    @Xiaojuan Liao, @Hui Zhang, Miyuki Koshimura, @Rong Huang, @Wenxin Yu, @Fagen Li

    Mathematical Problems in Engineering   2021   2021.7

    　More details

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

    DOI： https://doi.org/10.1155/2021/9615463

  • CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem Reviewed International journal

    @Aolong Zha, @Rongxuan Gao, @Qiong Chang, Miyuki Koshimura, @Itsuki Noda

    32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020   285 - 292   2021.1

    　More details

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

    DOI： 10.1109/ICTAI50040.2020.00053

  • A comparative analysis and improvement of MaxSAT encodings for coalition structure generation under MC-nets Reviewed International journal

    @Xiaojuan Liao, Miyuki Koshimura

    Journal of Logic and Computation   29   913 - 931   2019.10

    　More details

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

    Coalition structure generation (CSG) is one of the main research issues in the use of coalitional games in multiagent systems and weighted partial MaxSAT (WPM) encodings, i.e. rule relation-based WPM (RWPM) and agent relation-based WPM (AWPM), which are efficient for solving the CSG problem. Existing studies show that AWPM surpasses RWPM since it achieves more compact encoding; it generates fewer variables and clauses than RWPM. However, in this paper, we focus on a special case in which the two encodings generate identical numbers of variables and clauses. Experiments show that RWPM surprisingly has a dominant advantage over AWPM, which aroused our interest. We exploit the deep-rooted reason and find that it is the redundancy when encoding transitive laws in RWPM that leads to this situation. Finally, we remove redundant clauses for transitive laws in RWPM and develop an improved RWPM with refined transitive laws to solve the CSG problem. Experiments demonstrate that refined encoding is more compact and efficient than previous WPM encodings.

    DOI： 10.1093/logcom/exz017

  • Solving Coalition Structure Generation Problems over Weighted Graph Reviewed International journal

    #Emi Watanabe, Miyuki Koshimura, @Yuko Sakurai, Makoto Yokoo

    PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference   338 - 353   2019.10

    　More details

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

    DOI： 10.1007/978-3-030-33792-6_21

  • Maximum Satisfiability Formulation for Optimal Scheduling in Overloaded Real-Time Systems Reviewed International journal

    @Xiaojuan Liao, @Hui Zhang, Miyuki Koshimura, @Rong Huang, @Wenxin Yu

    PRICAI 2019: 16th Pacific Rim International Conference on Artificial Intelligence   1   618 - 631   2019.8

    　More details

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

    DOI： 10.1007/978-3-030-29908-8_49

  • 分割決定木を用いた分割関数ゲームの提携構造形成アルゴリズム Reviewed

    #査 澳龍，越村 三幸，@櫻井 祐子，横尾 真

    電子情報通信学会論文誌 D   J102-D ( 4 )   313 - 323   2019.4

    　More details

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

    DOI： 10.14923/transinfj.2018JDP7037

  • A Hybrid Encoding of Pseudo-Boolean Constraints into CNF Reviewed International journal

    Aolong Zha, Miyuki Koshimura, Hiroshi Fujita

    Conference on Technologies and Applications of Artificial Intelligence, TAAI 2017   9 - 12   2017.12

    　More details

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

    DOI： 10.1109/TAAI.2017.15

  • Mixed Radix Weight Totalizer Encoding for Pseudo-Boolean Constraints Reviewed International journal

    Aolong Zha, Naoki Uemura, Miyuki Koshimura, HIROSHI FUJITA

    29th International Conference on Tools with Artificial Intelligence   868 - 875   2017.11

    　More details

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

    DOI： 10.1109/ICTAI.2017.00135

  • Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation

    #Aolong Zha, #Kazuki Nomoto, @Suguru Ueda, Miyuki Koshimura, Yuko Sakurai, Makoto Yokoo

    20th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2017 PRIMA 2017 Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings   143 - 159   2017.10

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Coalition Structure Generation (CSG), a main research issue in the domain of coalition games, involves partitioning agents into exhaustive and disjoint coalitions to optimize the social welfare. The advent of compact representation schemes, such as Partition Decision Trees (PDTs), promotes the efficiency of solving CSG problems. This paper studies the CSG problem for partition function games (PFGs) which are coalitional games with externalities. In PFGs, each value of a coalition depends on how the other agents are partitioned. We apply PDTs to represent PFGs and present two methods to solve CSG problems: a depth-first branch-and-bound algorithm and MaxSAT encoding.

    DOI： 10.1007/978-3-319-69131-2_9

  • Reconstructing AES Key Schedule Images with SAT and MaxSAT Reviewed International journal

    Xiaojuan Liao, Hui Zhang, Miyuki Koshimura

    IEICE TRANSACTIONS on Information and Systems   E99D ( 1 )   141 - 150   2016.1

    　More details

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

    Cold boot attack is a side channel attack that recovers data from memory, which persists for a short period after power is lost. In the course of this attack, the memory gradually degrades over time and only a corrupted version of the data may be available to the attacker. Recently, great efforts have been made to reconstruct the original data from a corrupted version of AES key schedules, based on the assumption that all bits in the charged states tend to decay to the ground states while no bit in the ground state ever inverts. However, in practice, there is a small number of bits flipping in the opposite direction, called reverse flipping errors. In this paper, motivated by the latest work that formulates the relations of AES key bits as a Boolean Satisfiability problem, we move one step further by taking the reverse flipping errors into consideration and employing off-the-shelf SAT and MaxSAT solvers to accomplish the recovery of AES-128 key schedules from decayed memory images. Experimental results show that, in the presence of reverse flipping errors, the MaxSAT approach enables reliable recovery of key schedules with significantly less time, compared with the SAT approach that relies on brute force search to find out the target errors. Moreover, in order to further enhance the efficiency of key recovery, we simplify the original problem by removing variables and formulas that have relatively weak relations to the whole key schedule. Experimental results demonstrate that the improved MaxSAT approach reduces the scale of the problem and recover AES key schedules more efficiently when the decay factor is relatively large.

    DOI： 10.1587/transinf.2015EDP7223

  • MaxSAT Encoding for MC-Net-Based Coalition Structure Generation Problem with Externalities Reviewed International journal

    Xiaojuan Liao, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa

    IEICE TRANSACTIONS on Information and Systems   E97-D ( 7 )   1781 - 1789   2014.7

    　More details

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

    Coalition Structure Generation (CSG) means partitioning agents into exhaustive and disjoint coalitions so that the sum of values of all the coalitions is maximized. Solving this problem could be facilitated by employing some compact representation schemes, such as marginal contribution network (MC-net). In MC-net, the CSG problem is represented by a set of rules where each rule is associated with a real-valued weights, and the goal is to maximize the sum of weights of rules under some constraints. This naturally leads to a combinatorial optimization problem that could be solved with weighted partial MaxSAT (WPM). In general, WPM deals with only positive weights while the weights involved in a CSG problem could be either positive or negative. With this in mind, in this paper, we propose an extension of WPM to handle negative weights and take advantage of the extended WPM to solve the MC-net-based CSG problem. Specifically, we encode the relations between each pair of agents and reform the MC-net as a set of Boolean formulas. Thus, the CSG problem is encoded as an optimization problem for WPM solvers. Furthermore, we apply this agent relation-based WPM with minor revision to solve the extended CSG problem where the value of a coalition is affected by the formation of other coalitions, a coalition known as externality. Experiments demonstrate that, compared to the previous encoding, our proposed method speeds up the process of solving the CSG problem significantly, as it generates fewer number of Boolean variables and clauses that need to be examined by WPM solver.

    DOI： 10.1587/transinf.E97.D.1781

  • Using MaxSAT to Correct Errors in AES Key Schedule Images Reviewed International journal

    Xiaojuan Liao, Hui Zhang, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa

    25th International Conference on Tools with Artificial Intelligence   284 - 291   2013.11

    　More details

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

    DOI： 10.1109/ICTAI.2013.51

  • Modulo Based CNF Encoding of Cardinality Constraints and Its Application to MaxSAT Solvers Reviewed International journal

    Toru Ogawa, YangYang Liu, Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita

    25th International Conference on Tools with Artificial Intelligence   9 - 17   2013.11

    　More details

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

    DOI： 10.1109/ICTAI.2013.13

  • Modulo 計算に基づく基数制約のCNF符号化方式の提案と評価 Reviewed

    小川徹, 劉洋洋, 長谷川 隆三, 越村 三幸, 藤田 博

    システム情報科学紀要   18 ( 2 )   85 - 92   2013.7

    　More details

    Language：Japanese   Publishing type：Research paper (bulletin of university, research institution)  

  • SCSat: A Soft Constraint Guided SAT Solver Reviewed International journal

    HIROSHI FUJITA, Miyuki Koshimura, RYUZO HASEGAWA

    16th International Conference on Theory and Applications of Satisfiability Testing (SAT 2013)   415 - 421   2013.7

    　More details

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

  • Hybrid Particle Swarm Optimization and Convergence Analysis for Scheduling Problems Reviewed International journal

    Xue-Feng Zhang, Miyuki Koshimura, HIROSHI FUJITA, RYUZO HASEGAWA

    Evolutionary Computation and Multi-Agent Systems and Simulation (ECoMASS) Workshop   307 - 314   2012.7

    　More details

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

  • Rule Extraction from Micro-Blog using Inductive Logic Programming Reviewed International journal

    Noriacki Chikara, Miyuki Koshimura, HIROSHI FUJITA, RYUZO HASEGAWA

    2012 Spring World Congress on Engineering and Technology (SCET2012)   2   257 - 260   2012.5

    　More details

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

  • Evaluating Reranking Methods based on Link Co-occurence and Category in Wikipedia Reviewed International journal

    Yuichi Takiguchi, Koji Kurakado, Tetsuya Oishi, Miyuki Koshimura, Hiroshi Fujita, and Ryuzo Hasegawa

    4th International Conference on Agents and Artificial Intelligence   ( 1 )   2012.2

    　More details

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

  • Hybrid Particle Swarm Optimization with Parameter Selection Approaches to Solve Flow Shop Scheduling Problem Reviewed International journal

    Xue-Feng Zhang, Xuanye An, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa

    10th IEEE Internationa Conference on Cybernetic Intelligent Systems   2011.9

    　More details

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

  • 推薦理由を考慮した情報推薦システム Reviewed

    力 規晃，越村 三幸，藤田 博，長谷川 隆三

    システム情報科学紀要   16 ( 2 )   2011.9

    　More details

    Language：Japanese   Publishing type：Research paper (bulletin of university, research institution)  

  • Combining PSO and Local Search to Solve Scheduling Problems Reviewed International journal

    Xue-Feng Zhang, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa

    10th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO'11)   2011.7

    　More details

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

  • An Efficient Hybrid Particle Swarm Optimization for the Job Shop Scheduling Problem Reviewed International journal

    Xue-Feng Zhang, Miyuki Koshimura, Hiroshi Fujita and Ryuzo Hasegawa

    IEEE   2011.6

    　More details

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

  • EVALUATING RERANKING METHODS USING WIKIPEDIA FEATURES Reviewed International journal

    Koji Kurakado, Tetsuya Oishi, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

    Proc. of ICAART 2011   1   2011.1

    　More details

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

  • TRENDSPOTTER DETECTION SYSTEM FOR TWITTER Reviewed International journal

    Wataru Shirakihara, Tetsuya Oishi, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

    Proc. of ICAART 2011   1   2011.1

    　More details

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

  • A Multi-Layer Hybrid Particle Swarm Optimization Model for Flow Shop Scheduling Problem Reviewed International journal

    Xue-Feng Zhang, Bin Tong, Miyuki Koshimura, Hiroshi Fujita, and Ryuzo Hasegawa

    Australian Journal of Intelligent Information Processing Systems   12 ( 4 )   2010.12

    　More details

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

  • 極小モデル生成器MiniMGの試作 Reviewed

    矢野 明浩，中村 徹，長谷川 隆三，藤田 博，越村 三幸

    九州大学大学院システム情報科学紀要   15 ( 2 )   2010.9

    　More details

    Language：Japanese   Publishing type：Research paper (bulletin of university, research institution)  

  • A Hybrid Particle Swarm Optimization Algorithm HPTS for the Flow-Shop Scheduling Problem Reviewed

    Xue-Feng Zhang, Bin Tong, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa

    九州大学大学院システム情報科学紀要   15 ( 2 )   2010.9

    　More details

    Language：English   Publishing type：Research paper (bulletin of university, research institution)  

  • Rule Extraction from Blog Using Inductive Logic Programming Reviewed International journal

    Noriaki Chikara, Miyuki Koshimura, Hiroshi Fujita, Ryuzo Hasegawa

    Proc. of WEBPRESS 2010   2010.8

    　More details

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

  • Related Word Extraction from Wikipedia for Web Retrieval Assistance Reviewed International journal

    Kentaro Hori, Tetsuya Oishi, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

    Proc. of ICAART 2010   2   2010.1

    　More details

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

  • Related Word Extraction Algorithm for Query Expansion - an Evaluation - Reviewed International journal

    Tetsuya Oishi, Ttsnenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

    Proc. of ACCDS 2009   2009.12

    　More details

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

  • 関連単語抽出アルゴリズムを用いたWeb検索クエリの生成 Reviewed

    大石 哲也，倉元 俊介，峯 恒憲，長谷川 隆三，藤田 博，越村 三幸

    電子情報通信学会論文誌D   J92-D ( 3 )   2009.3

    　More details

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

  • Personalized Search using ODP-based User Profiles Created from User Bookmark Reviewed International journal

    Tetsuya Oishi, Yoshiaki Kambara, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, and Miyuki Koshimura

    Pacific Rim Int'l Conf. on Artificial Intelligence (PRICAI 2008)   2008.12

    　More details

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

  • A Method for Query Expansion Using the Related Word Extraction Algorithm Reviewed International journal

    Tetsuya Oishi, Shunsuke Kuramoto, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

    Proc. of WIRSS   2008.12

    　More details

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

  • User-Schedule-based Web Page Recommendation Reviewed International journal

    Tetsuya Oishi, Shunsuke Kuramoto, Hiroto Nagata, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, and Miyuki Koshimura

    The 2007 IEEE/WIC/ACM International Conference on Web Intelligence   2007.11

    　More details

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

  • DPLL型SATソルバを用いた極小モデル生成について Reviewed

    鹿田憲秀，谷口清則，長谷川隆三，藤田博，越村三幸

    九州大学大学院システム情報科学紀要   2007.9

    　More details

    Language：Japanese   Publishing type：Research paper (bulletin of university, research institution)  

  • A Language Design for Non-Interruptable Multithreading Environment Fuce Reviewed International journal

    Satoshi Amamiya, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura, Ryo Hirana, and Makoto Amamiya

    International Supercomputing Conference (ISC'07)   2007.6

    　More details

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

  • JavaによるSATソルバHerrsatの実装と学習節の削除法について Reviewed

    大森晋作，松下幸之助，長谷川隆三，藤田博，越村三幸

    九州大学大学院システム情報科学紀要   2007.3

    　More details

    Language：Japanese   Publishing type：Research paper (bulletin of university, research institution)  

  • Fuce言語HALの設計と実装 Reviewed

    雨宮聡史，平兮亮，越村三幸，藤田博，長谷川隆三

    九州大学大学院システム情報科学紀要   2006.9

    　More details

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

  • FPGA上のSATソルバPCMGTPへの前処理の導入 Reviewed

    松田純一，越村三幸，藤田博，長谷川隆三

    九州大学大学院システム情報科学紀要   2006.9

    　More details

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

  • FUCE上のストリーム処理とその記述言語 Reviewed

    長谷川隆三，藤田博，雨宮聡史，越村三幸，雨宮真人

    九州大学大学院システム情報科学紀要   2006.3

    　More details

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

  • FUCE言語とその処理系について Reviewed

    雨宮聡史，長谷川隆三，藤田博，越村三幸，雨宮真人

    九州大学大学院システム情報科学紀要   2006.3

    　More details

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

  • 鉄道信号システムのモデル検査器ＳＰＩＮによる検証

    大神茂之，清水亮，越村三幸，川村正，藤田博，長谷川隆三

    九州大学大学院システム情報科学紀要   2005.3

    　More details

    Language：Japanese  

  • FPGA上のSATソルバPCMGTPの改良について

    藤田博，長谷川隆三，越村三幸，木之下昇平，松田純一

    九州大学大学院システム情報科学紀要   2005.3

    　More details

    Language：Japanese  

  • キーワード関連語提案システムの精度向上と関連語を観点とした WEBページ要約文抽出について

    梅永明寛，竹下日出男，久本学，長谷川隆三，藤田博，越村三幸

    九州大学大学院システム情報科学紀要   2005.3

    　More details

    Language：Japanese  

  • ユーザに特化した情報収集エージェントの作成

    高砂 信吾，長谷川 隆三，藤田 博，越村 三幸

    九州大学大学院システム情報科学紀要   2004.3

    　More details

    Language：Japanese  

  • WEB検索におけるキーワード関連語提案システム

    大石 哲也，長谷川 隆三，藤田 博，越村 三幸

    九州大学大学院システム情報科学紀要   2004.3

    　More details

    Language：Japanese  

  • 一般化補題を利用したモデル生成法

    清水 純一，越村 三幸，藤田 博，長谷川 隆三

    九州大学大学院システム情報科学紀要   2003.3

    　More details

    Language：Japanese  

  • 二分決定グラフによるモデル生成木の刈込み

    岡 雄一郎，長谷川 隆三，越村 三幸

    九州大学大学院システム情報科学紀要   2003.3

    　More details

    Language：Japanese  

  • 畳込みと分岐補題を統合したモデル生成

    松下 慎，長谷川 隆三，藤田 博，越村 三幸

    九州大学大学院システム情報科学紀要   2002.3

    　More details

    Language：Japanese  

  • ダイアグラムに基づく法的論争支援システム Reviewed

    新田 克己, 柴崎 真人, 安村 禎明, 長谷川 隆三, 藤田 博, 越村 三幸, 井上 克已, 白井 康之, 小松 弘

    人工知能学会論文誌   17 ( 1 )   2002.1

    　More details

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

  • Efficient Minimal Model Generation Using Branching Lemmas Reviewed International journal

    Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

    Proc. of CADE-17   1831   184 - 199   2000.6

    　More details

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

  • 分岐補題導入による極小モデルの効率的生成法

    長谷川 隆三，藤田 博，越村 三幸

    九州大学大学院システム情報科学研究科報告   1999.9

    　More details

    Language：Japanese  

  • MGTP: A Parallel Theorem-Proving System Based on Model Generation Reviewed International journal

    Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

    Proc. of INAP98   1998.9

    　More details

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

  • Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving Reviewed International journal

    Ryuzo Hasegawa, Katsumi Inoue, Yoshihiko Ohta and Miyuki Koshimura

    Proc. of CADE-14   1249   176 - 190   1997.7

    　More details

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

  • 上昇型定理証明の探索効率を高めるノンホーンマジックセット Reviewed

    長谷川 隆三，井上 克已，太田 好彦，越村 三幸

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

    　More details

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

  • MGTPにおけるケース分割の重複削除手法とその評価

    松本 誉史，越村 三幸，久保山 哲二，長谷川 隆三

    九州大学大学院システム情報科学研究科報告   1997.3

    　More details

    Language：Japanese  

  • 上昇型定理証明のためのノンホーン・マジックセット

    長谷川 隆三，越村 三幸，井上 克已，太田 好彦

    九州大学大学院システム情報科学研究科報告   1 ( 1 )   1996.9

    　More details

    Language：Japanese   Publishing type：Research paper (bulletin of university, research institution)  

  • Lazy Model Generation for Improving the Efficiency of Forward Reasoning Theorem Provers Reviewed International journal

    Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita

    Proc. of the Intl. Workshop on Automated Reasoning   1992.7

    　More details

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

  • Embedding Negation as Failure into a Model Generation Theorem Prover Reviewed International journal

    Katsumi Inoue, Miyuki Koshimura, Ryuzo Hasegawa

    Proc. of CADE-11   1992.6

    　More details

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

▼display all

Books

  • Applied Satisfiability: Cryptography, Scheduling, and Coalitional Games International journal

    Xiaojuan Liao, Miyuki Koshimura（Role：Joint author）

    Wiley  2025.1    （ ISBN:9781394249787 ）

    　More details

    Total pages：254   Language：English   Book type：Textbook, survey, introduction

Presentations

  • 頂点の次数に着目したラムゼーグラフ結合の評価

    @越村 三幸

    情報処理学会第86回全国大会  2024.3 

    　More details

    Event date： 2024.3

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：神奈川大学 横浜キャンパス   Country：Japan  

  • 垂直搬送機のMaxSATによる最適スケジューリング

    越村 三幸、@野田 五十樹

    スケジューリング・シンポジウム2022  2022.9 

    　More details

    Event date： 2022.9

    Language：Japanese   Presentation type：Oral presentation (general)  

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

  • 推移関係を表す SAT 節の削減

    越村 三幸、@廖 暁鵑、#渡部 恵海、@櫻井 祐子、横尾 真

    2020年度 人工知能学会全国大会（第34回）  2020.6 

    　More details

    Event date： 2020.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：オンライン開催   Country：Japan  

  • SATソルバーGlucoseを用いたMCS列挙

    越村 三幸、@佐藤 健

    2019年度 人工知能学会全国大会（第33回）  2019.6 

    　More details

    Event date： 2019.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：朱鷺メッセ 新潟コンベンションセンター   Country：Japan  

  • モデルとUnsat Coreを利用したMaxSATソルバーの試作

    越村 三幸

    2016年度 人工知能学会全国大会（第30回）  2016.6 

    　More details

    Event date： 2016.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：北九州国際会議場   Country：Japan  

  • 基数制約のSAT符号化を用いたMaxSATソルバーの試作

    越村 三幸, 有村 寿高

    2014年度 人工知能学会全国大会（第28回）  2014.5 

    　More details

    Event date： 2014.5

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ひめぎんホール   Country：Japan  

  • MaxSATの一拡張について

    越村 三幸, 廖 暁鵑, 藤田 博, 長谷川 隆三

    第11回情報科学技術フォーラム(FIT 2012)  2012.9 

    　More details

    Event date： 2012.9

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：法政大学　小金井キャンパス   Country：Japan  

  • QMaxSAT: Q-dai MaxSAT ソルバー

    越村 三幸，安 宣烨，藤田 博，長谷川 隆三

    2011年度 人工知能学会全国大会（第25回）  2011.6 

    　More details

    Event date： 2011.6

    Presentation type：Oral presentation (general)  

    Venue：アイーナ いわて県民情報交流センター   Country：Japan  

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

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

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

    　More details

    Event date： 2009.9

    Presentation type：Oral presentation (general)  

    Venue：岡山大学　津島キャンパス   Country：Japan  

  • 極小モデル生成とジョブショップスケジューリング問題の解法

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

    日本ソフトウェア科学会 第25回大会  2008.12 

    　More details

    Event date： 2008.9

    Presentation type：Oral presentation (general)  

    Venue：筑波大学 東京キャンパス   Country：Japan  

  • Minimal Model Generation with Factorization and Constrained Search International conference

    Miyuki Koshimura, Megumi Kita, Ryuzo Hasegawa

    Tableaux 2000  2000.7 

    　More details

    Event date： 2000.7

    Venue：University of St Andrews   Country：United Kingdom  

  • A Proof of Completeness for Non-Horn Magic Sets and Its Application to Proof Condensation International conference

    Miyuki Koshimura, Ryuzo Hasegawa

    Tableaux 1999  1999.6 

    　More details

    Event date： 1999.6

    Venue：The Inn at Saratoga   Country：United States  

  • モデル生成型証明器上の様相命題タブロ

    越村 三幸，長谷川 隆三

    The Logic Programming Conference' 91  1991.7 

    　More details

    Event date： 1991.7

    Presentation type：Oral presentation (general)  

    Venue：機械振興会館（東京都港区）   Country：Japan  

  • 抽象モデルを利用したSAT問題の前処理

    越村三幸，長谷川隆三

    電子情報通信学会〔人工知能と知識処理〕  2006.5 

    　More details

    Presentation type：Oral presentation (general)  

    Venue：機械振興会館（東京）   Country：Japan  

  • 鉄道信号システムの連動図と連動装置のモデル検査

    越村三幸，川村正，大神茂之，清水亮，藤田博，長谷川隆三

    産業技術総合研究所システム検証研究センター  2005.10 

    　More details

    Presentation type：Oral presentation (general)  

    Venue：千里ライフサイエンスセンター   Country：Japan  

  • Optimal Scheduling for a Vertical Transport Machine with MaxSAT Invited International conference

    Miyuki Koshimura

    NII 湘南会議 Shonan Meeting  2023.10 

    　More details

    Event date： 2023.10

    Language：English   Presentation type：Oral presentation (general)  

    Country：Japan  

  • 敵対者が存在する重み付き MaxSAT の定式化と厳密アルゴリズムの提案

    #山下 魁人、#菅原 知也、越村 三幸、横尾 真

    SMASH22 WINTER SYMPOSIUM  2022.2 

    　More details

    Event date： 2022.2

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ハイブリッド開催（金沢市 + オンライン）   Country：Japan  

  • ADSAT：敵対者が存在するMaxSAT

    #菅原 知也、越村 三幸、横尾 真

    2021年度 人工知能学会全国大会（第35回）  2021.6 

    　More details

    Event date： 2021.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：オンライン開催   Country：Japan  

  • MaxSATソルバーを用いたMCS列挙の実装とその評価

    越村 三幸, ＠佐藤 健

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

    　More details

    Event date： 2019.3

    Language：Japanese   Presentation type：Oral presentation (general)  

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

  • Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation

    Miyuki Koshimura, #Aolong Zha, #Kazuki Nomoto, @Suguru Ueda, @Yuko Sakurai, Makoto Yokoo

    The 4th Kakenhi Kiban-A&B/NII Collaborate Research Meeting  2019.3 

    　More details

    Event date： 2019.3

    Language：English   Presentation type：Symposium, workshop panel (public)  

    Venue：西南学院百年館（松緑館）   Country：Japan  

  • MC-netsを用いた提携構造形成問題のMaxSAT符号化の改良と評価

    越村 三幸, 廖 暁鵑, 野本 一貴, 上田 俊, 櫻井 祐子, 横尾 真

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

    　More details

    Event date： 2018.3

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：指宿市民会館 中会議室   Country：Japan  

  • MC-netsを用いた提携構造形成問題のMaxSAT符号化の改良

    越村 三幸, 廖 暁鵑, 野本 一貴, 上田 俊, 櫻井 祐子, 横尾 真

    日本ソフトウェア科学会 第34回大会  2017.9 

    　More details

    Event date： 2017.9

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：慶應義塾大学 日吉キャンパス   Country：Japan  

  • 分割決定木で表現された提携構造形成問題のMaxSAT符号化

    越村 三幸, 査 澳龍, 野本 一貴, 櫻井 祐子, 横尾 真

    情報処理学会第79回全国大会  2017.3 

    　More details

    Event date： 2017.3

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：名古屋大学東山キャンパス   Country：Japan  

  • MaxSAT Encoding for MC-net/PDT-based Coalition Structure Generation Problem Invited

    Miyuki Koshimura, Kazuki Nomoto, Yuko Sakurai, Makoto Yokoo

    The 10th CSPSAT Seminar  2016.11 

    　More details

    Event date： 2016.11

    Language：English   Presentation type：Public lecture, seminar, tutorial, course, or other speech  

    Venue：神戸大学 自然科学総合研究棟   Country：Japan  

  • MaxSATを利用したAES暗号鍵の復元法の改良

    越村 三幸, 廖暁鵑

    NII共同研究プロジェクト:クラウド上のソフトウェア最適配置問題の解法 & 解集合プログラミングによるシステム検証 合同ミーティング  2016.3 

    　More details

    Event date： 2016.3

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：熊本市民会館   Country：Japan  

  • MGTPとQMaxSAT

    越村 三幸

    第8回CSPSAT講演会  2015.3 

    　More details

    Event date： 2015.3

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：別府国際コンベンションセンター   Country：Japan  

  • QwMaxSAT: A weighted partial MaxSAT solver

    Miyuki Koshimura, Toshitaka Arimura

    The 7th CSPSAT & ASP Seminar  2014.4 

    　More details

    Event date： 2014.4

    Language：English   Presentation type：Public lecture, seminar, tutorial, course, or other speech  

    Venue：神戸大学 自然科学総合研究棟   Country：Japan  

  • MaxSATを利用したAES暗号鍵の復元

    廖 暁鵑, 越村 三幸

    火の国情報シンポジウム2014  2014.3 

    　More details

    Event date： 2014.3

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：大分大学工学部   Country：Japan  

  • QwMaxSAT: a Weighted Partial MaxSAT Solver

    越村 三幸

    論理と推論の理論, 実装, 応用に関する合同セミナー  2013.7 

    　More details

    Event date： 2013.7

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：北海道大学 工学部C304 ERATOセミナ室   Country：Japan  

  • QMaxSAT=SATソルバー + 基数制約の符号化

    越村 三幸

    第2回CSPSAT2研究会  2013.3 

    　More details

    Event date： 2013.3

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：唐津市民交流プラザ 第2会議室   Country：Japan  

  • An Extension of MaxSAT and Its Application to the Coalition Structure Generation

    Miyuki Koshimura, Xiaojuan Liao

    Fifth CSPSAT & ASP Seminar  2012.10 

    　More details

    Event date： 2012.10

    Language：English   Presentation type：Public lecture, seminar, tutorial, course, or other speech  

    Venue：神戸大学 自然科学総合研究棟   Country：Japan  

  • ここまでやれる人工知能システム Invited

    越村三幸

    2012.5 

    　More details

    Event date： 2012.5

    Presentation type：Oral presentation (general)  

    Venue：東洋紡績株式会社総合研究所   Country：Japan  

  • 提携構造形成問題の MaxSAT 符号化

    越村三幸

    第12回CSPSAT研究会  2012.3 

    　More details

    Event date： 2012.3

    Presentation type：Oral presentation (general)  

    Venue：由布市 湯布院公民館 視聴覚室   Country：Japan  

  • A Simple Implementation of a Partial MaxSAT Solver with MiniSat

    Miyuki Koshimura

    Third CSPSAT & ASP Seminar  2011.11 

    　More details

    Event date： 2011.11

    Presentation type：Public lecture, seminar, tutorial, course, or other speech  

    Venue：神戸大学 自然科学総合研究棟   Country：Japan  

  • QMaxSAT:部分MaxSATソルバーの簡便な一実装

    越村 三幸，安 宣烨，藤田 博，長谷川 隆三

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

    　More details

    Event date： 2011.9

    Presentation type：Oral presentation (general)  

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

  • QMaxSAT version 0.11 & 0.4

    越村三幸

    第10回CSPSAT研究会  2011.8 

    　More details

    Event date： 2011.8

    Venue：九州大学西新プラザ   Country：Japan  

  • Partial Max-SAT ソルバー QMaxSAT の評価

    越村 三幸，張 彤，藤田 博，長谷川 隆三

    人工知能学会 第81回 人工知能基本問題研究会  2011.1 

    　More details

    Event date： 2011.1 - 2011.2

    Presentation type：Oral presentation (general)  

    Country：Japan  

    山梨大学（甲府キャンパス　情報メディア館5F 多目的ホール）

  • JSSPによるGlueMiniSat2.2.0の評価

    越村 三幸，鍋島 英知

    第8回CSPSAT研究会  2010.12 

    　More details

    Event date： 2010.12

    Presentation type：Oral presentation (general)  

    Venue：九州大学西新プラザ   Country：Japan  

  • QMaxSAT: Q-dai Max SAT Solver

    越村 三幸

    第７回CSPSAT研究会  2010.7 

    　More details

    Event date： 2010.7

    Presentation type：Oral presentation (general)  

    Venue：横谷温泉旅館   Country：Japan  

  • SATSHOPで未解決ベンチマークに挑戦

    越村三幸

    第4回CSPSAT研究会  2009.7 

    　More details

    Event date： 2009.7

    Presentation type：Oral presentation (general)  

    Venue：ホテルニューアワジ プラザ淡路島   Country：Japan  

  • ジョブショップスケジューリング問題の解法 -下界の取り込み-

    越村三幸

    第3回CSPSAT研究会  2009.3 

    　More details

    Event date： 2009.3

    Presentation type：Oral presentation (general)  

    Venue：九州大学西新プラザ   Country：Japan  

  • ジョブショップスケジューリング問題の解法の性能評価

    越村三幸，福原正浩

    第2回 CSPSAT研究会  2008.12 

    　More details

    Event date： 2008.12

    Presentation type：Oral presentation (general)  

    Venue：国立情報学研究所   Country：Japan  

  • SATソルバの並列分散実行について

    越村三幸，力規晃

    第1回CSPSAT研究会  2008.8 

    　More details

    Event date： 2008.8

    Presentation type：Oral presentation (general)  

    Venue：神戸大学 自然科学総合研究棟3号館(東) 4F   Country：Japan  

  • アトム集合に関して極小なモデル生成

    越村三幸

    NII 共同研究「補題再利用による効率的な分散・協調 SAT システムの構築に関する研究」に関する第３回ミーティング  2008.3 

    　More details

    Event date： 2008.3

    Presentation type：Oral presentation (general)  

    Venue：神戸大学　自然科学総合研究棟   Country：Japan  

  • 抽象モデルを利用したSATの前処理

    越村三幸

    NII共同研究（分散ＳＡＴ）第3回ミーティング  2007.3 

    　More details

    Event date： 2007.3

    Presentation type：Oral presentation (general)  

    Venue：神戸大学　自然科学総合研究棟   Country：Japan  

  • FPGAによるSATソルバーの試作と評価

    越村三幸

    NII共同研究（分散ＳＡＴ）第2回ミーティング  2006.12 

    　More details

    Event date： 2006.12

    Presentation type：Oral presentation (general)  

    Venue：鳥取大学　工学研究科棟   Country：Japan  

  • モデル検査器を用いたFUCEマルチスレッドプログラムの開発

    越村三幸，梅田眞由美，平兮亮，藤田博，長谷川隆三

    第５回情報科学技術フォーラム（FIT2006)  2006.9 

    　More details

    Event date： 2006.9

    Presentation type：Oral presentation (general)  

    Venue：福岡大学   Country：Japan  

  • Mode Analysis for Generating a Non-Horn Magic Set International conference

    Miyuki Koshimura

    Workshop on Finite Domain Theorem Proving  1994.3 

    　More details

    Presentation type：Oral presentation (general)  

    Venue：Duke大学（米），ECRC（独），ANU（豪）   Country：Other  

  • MGTP:モデル生成型定理証明システム −実装と応用−

    越村三幸，藤田博，長谷川隆三

    1999.11 

    　More details

    Presentation type：Oral presentation (general)  

    Venue：京都大学数理解析研究所   Country：Japan  

  • 数独パズルにおける補題の解析

    清水純一，越村三幸，長谷川隆三

    電子情報通信学会  2001.5 

    　More details

    Presentation type：Oral presentation (general)  

    Venue：千葉工業大学（千葉）   Country：Japan  

    Junichi Shimizu, Miyuki Koshimura, Ryuzo Hasegawa:
    An Analysis of Lemmas Extracted from Model Generation Proofs for Sudoku(Number Place)Puzzle,
    Technical Report of IEICE.
    AI2001-5

  • 二分決定グラフによるモデル生成木の刈込み

    岡雄一郎，越村三幸，長谷川隆三

    電子情報通信学会  2001.7 

    　More details

    Presentation type：Oral presentation (general)  

    Venue：広島市立大学（広島）   Country：Japan  

  • モデル生成型定理証明手続きによるCTLのモデル検査

    清水亮，長谷川隆三，越村三幸

    電子情報通信学会  2003.5 

    　More details

    Presentation type：Oral presentation (general)  

    Venue：機会振興会館（東京）   Country：Japan  

    Ryo Shimizu, Ryuzo Hasegawa, Miyuki Koshimura:
    CTL Model Checking with Model Generation Theorem Prover,
    Technical Report of IEICE
    AI2003-7

  • 抽象モデル生成による節集合の前処理

    梅田眞由美，越村三幸，長谷川隆三

    電子情報通信学会  2004.6 

    　More details

    Presentation type：Oral presentation (general)  

    Venue：機械振興会館（東京）   Country：Japan  

    Mayumi Umeda, Miyuki Koshimura, Ryuzo Hasegawa:
    Preprocessing Clause Sets by Abstract Model Generation.
    Technical Report of IEICE AI2004-7

  • 鉄道信号システムのモデル検査による検証(I)-連動図表の検証- (II)-連動装置の検証-

    大神茂之，清水亮，越村三幸，川村正，藤田博，長谷川隆三

    情報処理学会  2005.3 

    　More details

    Presentation type：Oral presentation (general)  

    Venue：電気通信大学   Country：Japan  

▼display all

MISC

  • MaxSAT : SATの最適化問題への拡張 ーMaxSATソルバーの活用法ー

    越村 三幸, 藤田 博

    情報処理， Vol.57 No.8   2016.8

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

  • SATとラムゼー数 〜数学の未解決問題への挑戦〜

    藤田 博, 越村 三幸

    情報処理， Vol.57 No.8   2016.8

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

  • SAT/Max-SAT競技会参加記

    鍋島 英知, 越村 三幸, 番原 睦則

    コンピュータソフトウェア， Vol.29, No.4，pp.9-14   2012.11

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

    Report on SAT Competition and Max-SAT Evaluation

  • モデル列挙とモデル計数

    長谷川隆三，藤田博，越村三幸

    人工知能学会誌，Vol.25，No.1，pp.96-104   2010.1

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

    Model Enumeration and Model Counting

  • Partial Max-SAT Encoding for the Job Shop Scheduling Problem

    Miyuki Koshimura and Hidetomo Nabeshima

    , SAT2009 competitive event booklet: preliminary version   2009.9

    　More details

    Language：English   Publishing type：Internal/External technical report, pre-print, etc.  

    Other Link： http://www.cril.univ-artois.fr/SAT09/solvers/booklet.pdf

  • モデル生成型定理証明と要素技術

    長谷川隆三，藤田博，越村三幸

    コンピュータソフトウェア，Vol.25，No.3，pp.2-10   2008.7

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

  • A Model Generation Based Theorem Prover MGTP for First-Order Logic

    Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura, Yasuyuki Shirai

    Computational Logic: Logic Programming and Beyond   2002.8

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

  • タブロー法とモデル生成型定理証明

    長谷川 隆三、藤田 博、越村 三幸

    人工知能学会誌   2001.9

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

  • 並列プログラムおよび性能デバッギングのための視覚化

    長谷川 隆三，越村 三幸

    コンピュータソフトウェア   1995.7

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

  • 定理証明系ＭＧＴP

    長谷川隆三，越村三幸

    bit別冊（第ＩＩＩ編第３章６節），共立出版   1993.7

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

▼display all

Works

Industrial property rights

Patent   Number of applications: 2   Number of registrations: 1
Utility model   Number of applications: 0   Number of registrations: 0
Design   Number of applications: 0   Number of registrations: 0
Trademark   Number of applications: 0   Number of registrations: 0

Professional Memberships

  • Japan Society for Software and Technology

  • Information Processing Society of Japan

  • Japan Society for Artificial Intelligence

  • The Institute of Electronics, Information and Communication Engineers

  • THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS

    　 More details

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

    　 More details

  • 情報処理学会

    　 More details

  • 人工知能学会

    　 More details

▼display all

Committee Memberships

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

    2014.4 - 2016.3   

Academic Activities

  • Program Committee International contribution

    IJCAI 2024 (the 33rd International Joint Conference on Artificial Intelligence)  （ North Korea ） 2024.8

    　More details

    Type：Competition, symposium, etc. 

  • Program Committee International contribution

    AAAI-24 (the 38th Annual AAAI Conference on Artificial Intelligence)  （ VANCOUVER Canada ） 2024.2

    　More details

    Type：Competition, symposium, etc. 

  • Program Committee International contribution

    IJCAI 2023 (the 32nd International Joint Conference on Artificial Intelligence)  （ Cape Town SouthAfrica ） 2023.8

    　More details

    Type：Competition, symposium, etc. 

  • Screening of academic papers

    Role(s)： Peer review

    2023

    　More details

    Type：Peer review 

    Number of peer-reviewed articles in foreign language journals：4

    Number of peer-reviewed articles in Japanese journals：1

    Proceedings of International Conference Number of peer-reviewed papers：5

    Proceedings of domestic conference Number of peer-reviewed papers：0

  • Program Committee International contribution

    IJCAI-ECAI 2022 (the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence)  （ VIENNA Austria ） 2022.7

    　More details

    Type：Competition, symposium, etc. 

  • Program Committee International contribution

    IIAI AAI 2022: 11th International Congress on Advanced Applied Informatics  （ Japan ） 2022.7

    　More details

    Type：Competition, symposium, etc. 

  • Screening of academic papers

    Role(s)： Peer review

    2022

    　More details

    Type：Peer review 

    Number of peer-reviewed articles in foreign language journals：6

    Number of peer-reviewed articles in Japanese journals：0

    Proceedings of International Conference Number of peer-reviewed papers：9

    Proceedings of domestic conference Number of peer-reviewed papers：0

  • Program Committee International contribution

    IJCAI2021 (30th International Joint Conference on Artificial Intelligence)  （ Montreal Canada ） 2021.8

    　More details

    Type：Competition, symposium, etc. 

  • Program Committee International contribution

    IIAI AAI 2021: 10th International Congress on Advanced Applied Informatics  （ Japan ） 2021.7

    　More details

    Type：Competition, symposium, etc. 

  • Program Committee International contribution

    IJCAI-PRICAI 2020 (29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence)  （ Japan ） 2021.1

    　More details

    Type：Competition, symposium, etc. 

  • Screening of academic papers

    Role(s)： Peer review

    2021

    　More details

    Type：Peer review 

    Number of peer-reviewed articles in foreign language journals：2

    Number of peer-reviewed articles in Japanese journals：1

    Proceedings of International Conference Number of peer-reviewed papers：10

    Proceedings of domestic conference Number of peer-reviewed papers：0

  • Screening of academic papers

    Role(s)： Peer review

    2020

    　More details

    Type：Peer review 

    Number of peer-reviewed articles in foreign language journals：1

    Number of peer-reviewed articles in Japanese journals：1

    Proceedings of International Conference Number of peer-reviewed papers：5

    Proceedings of domestic conference Number of peer-reviewed papers：0

  • Screening of academic papers

    Role(s)： Peer review

    2019

    　More details

    Type：Peer review 

    Number of peer-reviewed articles in foreign language journals：0

    Number of peer-reviewed articles in Japanese journals：1

    Proceedings of International Conference Number of peer-reviewed papers：3

    Proceedings of domestic conference Number of peer-reviewed papers：0

  • 座長（Chairmanship）

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

    　More details

    Type：Competition, symposium, etc. 

  • Screening of academic papers

    Role(s)： Peer review

    2018

    　More details

    Type：Peer review 

    Number of peer-reviewed articles in foreign language journals：2

    Number of peer-reviewed articles in Japanese journals：0

    Proceedings of International Conference Number of peer-reviewed papers：0

    Proceedings of domestic conference Number of peer-reviewed papers：0

  • Screening of academic papers

    Role(s)： Peer review

    2017

    　More details

    Type：Peer review 

    Number of peer-reviewed articles in foreign language journals：1

    Number of peer-reviewed articles in Japanese journals：1

    Proceedings of International Conference Number of peer-reviewed papers：1

    Proceedings of domestic conference Number of peer-reviewed papers：0

  • 座長（Chairmanship）

    2016年度人工知能学会全国大会（第30回）  （ Japan ） 2016.6

    　More details

    Type：Competition, symposium, etc. 

  • オーガナイザ（SAT技術の理論，実装，応用）

    2015年度 人工知能学会全国大会（第29回）  （ Japan ） 2015.5 - 2015.6

    　More details

    Type：Competition, symposium, etc. 

    Number of participants：1,000

  • 座長（Chairmanship）

    人工知能学会 第97回人工知能基本問題研究会  （ Japan ） 2015.3

    　More details

    Type：Competition, symposium, etc. 

  • 座長（Chairmanship） International contribution

    Workshop on Graph-based Algorithms for Big Data and its Applications (GABA2014)  （ Japan ） 2014.11

    　More details

    Type：Competition, symposium, etc. 

  • Program Committee International contribution

    Workshop on Graph-based Algorithms for Big Data and its Applications (GABA2014)  （ Keio University, Hiyoshi, Yokohama Japan ） 2014.11

    　More details

    Type：Competition, symposium, etc. 

  • オーガナイザ（SAT技術の理論，実装，応用）

    2014年度 人工知能学会全国大会（第28回）  （ Japan ） 2014.5

    　More details

    Type：Competition, symposium, etc. 

    Number of participants：1,000

  • 座長（Chairmanship）

    火の国情報シンポジウム2014  （ Japan ） 2014.3

    　More details

    Type：Competition, symposium, etc. 

  • 座長（Chairmanship）

    2013年度人工知能学会全国大会（第27回）  （ Japan ） 2013.6

    　More details

    Type：Competition, symposium, etc. 

  • オーガナイザ（SAT技術の理論，実装，応用）

    2013年度 人工知能学会全国大会（第27回）  （ Japan ） 2013.6

    　More details

    Type：Competition, symposium, etc. 

    Number of participants：1,000

  • 座長（Chairmanship）

    2012年度人工知能学会全国大会（第26回）  （ Japan ） 2012.6

    　More details

    Type：Competition, symposium, etc. 

  • オーガナイザ（SAT技術の理論，実装，応用）

    2012年度 人工知能学会全国大会（第26回）  （ Japan ） 2012.6

    　More details

    Type：Competition, symposium, etc. 

  • 座長（Chairmanship）

    2011年度人工知能学会全国大会（第25回）  （ Japan ） 2011.6

    　More details

    Type：Competition, symposium, etc. 

▼display all

Other

  • QMaxSAT was placed second in the industrial subcategory of partial Max-SAT category of the 2013 MaxSAT evaluation.

    2013.7

    　More details

    Max-SATは，SATの最適化問題向けの拡張である．QMaxSAT(Q-dai MaxSATソルバー)はPartial MaxSAT用のソルバーである．Max-SATソルバーの実装法には幾つかあるが，QMaxSATはSATソルバーMiniSATに基数制約処理機能を加えて実装されているSATベースのソルバーである．

  • QMaxSAT was placed first in both the industrial subcategory and the crafted subcategory of partial Max-SAT category of the 2012 MaxSAT evaluation.

    2012.6

    　More details

    Max-SATは，SATの最適化問題向けの拡張である．QMaxSAT(Q-dai MaxSATソルバー)はPartial MaxSAT用のソルバーである．Max-SATソルバーの実装法には幾つかあるが，QMaxSATはSATソルバーMiniSATに基数制約処理機能を加えて実装されているSATベースのソルバーである．

  • QMaxSAT(Q-dai MaxSAT Solver) was placed first in the industrial subcategory and second in the crafted subcategory of partial Max-SAT category of the 2011 MaxSAT evaluation.

    2011.6

    　More details

    Max-SATは，SATの最適化問題向けの拡張である．QMaxSAT(Q-dai MaxSATソルバー)はPartial MaxSAT用のソルバーである．Max-SATソルバーの実装法には幾つかあるが，QMaxSATはSATソルバーMiniSATに基数制約処理機能を加えて実装されているSATベースのソルバーである．

  • QMaxSAT(Q-dai MaxSAT Solver) was placed first in the industrial subcategory and second in the crafted subcategory of partial Max-SAT category of the 2010 MaxSAT evaluation.

    2010.7

Research Projects

  • 物流システムの最適化に関する研究

    2023.8 - 2025.3

    Joint research

    　 More details

    Authorship：Principal investigator  Grant type：Other funds from industry-academia collaboration

  • 体外診断用医療機器により取得されたデジタル画像の新規解析法の検討

    2019.7 - 2020.3

    Joint research

    　 More details

    Authorship：Principal investigator  Grant type：Other funds from industry-academia collaboration

  • Problem Solving with SAT Oracles

    Grant number：19H04175  2019 - 2022

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

    Koshimura Miyuki

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

    We have investigated the SAT oracle method, which uses the SAT solver call as NP oracle, by applying it to several applications including (1) enumerating minimal correction subsets (MCSes), (2)clique partitioning problems (3) optimal scheduling in overloaded real-time systems, and (4) optimal scheduling for vertical transport machine in automatic warehouse.
    (1) shows that our proposed method is more efficient that state-of-the-art MCS enumerators on average to deal with partial MaxSAT instances. (2) introduces a series of concise Integer Linear Programming formulations that can reduce even more transitivity constraints, and theoretically evaluates the amount of reduction. (3) demonstrate that, compared with the existing satisfiability-based methods, the proposed method significantly improves the efficiency of identifying the optimal schedule. (4) shows that the proposed method can solve the practical problems in reasonable time, and succeeds to improve transport capacity.

    CiNii Research

  • 体外診断用医療機器により取得されたデジタル画像の新規解析法の検討

    2018.4 - 2019.3

    Joint research

    　 More details

    Authorship：Principal investigator  Grant type：Other funds from industry-academia collaboration

  • 工場設備保全における軸受の異常判定システムへの人工知能の適用

    2017.8 - 2018.3

    Joint research

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 体外診断用医療機器により取得されたデジタル画像の新規解析法の検討

    2017.7 - 2018.3

    Joint research

    　 More details

    Authorship：Principal investigator  Grant type：Other funds from industry-academia collaboration

  • Ramsey数に関する計算科学的研究

    Grant number：17K00307  2017 - 2019

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

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 推論・学習機能を備えた実験候補推薦システムの研究開発

    Grant number：16K00304  2016 - 2018

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

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • SATソルバーの性能向上および応用に関する研究

    2015.4 - 2016.3

    Joint research

    　 More details

    Authorship：Principal investigator  Grant type：Other funds from industry-academia collaboration

  • SATソルバーの性能向上および応用に関する研究

    2014.10 - 2015.3

    Joint research

    　 More details

    Authorship：Principal investigator  Grant type：Other funds from industry-academia collaboration

  • 基数制約を用いたSATソルバーの拡張とその応用に関する研究

    Grant number：25330085  2013 - 2015

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

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • 大規模組合せ最適化問題のEPR解法に関する研究

    Grant number：25330262  2013 - 2015

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

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • SATソルバおよびJavaの化学分野への適用可能性に関する検討

    2010.5 - 2011.3

    Joint research

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 新しいSAT符号化法、新しいSATソルバー、及び求解困難な問題への応用に関する研究

    2010.4 - 2011.3

    Joint research

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 超高性能自動推論システムのための高抽象度機能素子に関する研究

    Grant number：22650028  2010 - 2012

    Grants-in-Aid for Scientific Research  Grant-in-Aid for Exploratory Research

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 高性能SATソルバーによる制約最適化問題の解法とその並列処理に関する研究

    2009.12 - 2011.3

    Joint research

    　 More details

    Authorship：Principal investigator  Grant type：Other funds from industry-academia collaboration

  • SAT変換技術の拡張による求解困難な制約最適化問題の解法に関する研究

    2009.4 - 2010.3

    Joint research

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 大規模SAT問題解決のためのEPRプルーバーに関する研究

    Grant number：21300054  2009 - 2012

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

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 個別化Web検索支援システムの開発に関する研究

    Grant number：21500102  2009 - 2011

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

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • 細粒度マルチスレッド原理による言語処理系および分散並列ＯＳ構成法の研究

    Grant number：21300011  2009 - 2011

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

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • SAT変換による制約最適化問題の限界突破

    2008.4 - 2009.3

    Joint research

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 制約最適化問題のSAT変換による解法とその並列分散処理に関する研究

    Grant number：20240003  2008 - 2011

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

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 補題再利用による効率的な分散・協調SATシステムの構築に関する研究

    2007.4 - 2008.3

    Joint research

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 作動時に再構成可能な演算チップのためのソフトウェア開発技術に関する研究

    Grant number：14658094  2002 - 2004

    Grants-in-Aid for Scientific Research  Grant-in-Aid for Exploratory Research

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • プラスティック・セル・アーキテクチャの言語処理系に関する研究

    Grant number：14580380  2002 - 2004

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

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 超並列計算機のアーキテクチャと宣言型言語に関する研究

    Grant number：09044174  1997 - 1998

    Grants-in-Aid for Scientific Research  Grant-in-Aid for International Scientific Research

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • モデル生成型定理証明に基づく分散知識情報処理システムの構築

    Grant number：08458080  1996 - 1998

    Grants-in-Aid for Scientific Research  Grant-in-Aid for General Research (B)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • KLIC上のMGTP処理系

    1995.7 - 1996.3

    Research commissions

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

▼display all

Class subject

  • 情報論理学II

    2023.6 - 2023.8   Summer quarter

  • 電気情報工学実験Ⅰ

    2023.4 - 2023.9   First semester

  • 情報論理学I

    2023.4 - 2023.6   Spring quarter

  • サイバーセキュリティ基礎論

    2023.4 - 2023.6   Spring quarter

  • 情報論理学II

    2022.6 - 2022.8   Summer quarter

  • 電気情報工学実験Ⅰ

    2022.4 - 2022.9   First semester

  • 情報論理学I

    2022.4 - 2022.6   Spring quarter

  • サイバーセキュリティ基礎論

    2022.4 - 2022.6   Spring quarter

  • 電気情報工学実験Ⅰ

    2021.4 - 2021.9   First semester

  • 情報論理学

    2021.4 - 2021.9   First semester

  • 情報論理学

    2021.4 - 2021.9   First semester

  • 情報科学

    2020.10 - 2021.3   Second semester

  • 数値解析演習

    2020.4 - 2020.9   First semester

  • 電気情報工学実験Ⅰ

    2020.4 - 2020.9   First semester

  • プログラミング演習

    2019.10 - 2020.3   Second semester

  • 電気情報工学実験Ⅰ

    2019.4 - 2019.9   First semester

  • 数値解析演習

    2019.4 - 2019.9   First semester

  • 電気情報工学実験Ⅰ

    2018.4 - 2018.9   First semester

  • 数値解析演習

    2018.4 - 2018.9   First semester

  • プログラミング演習

    2017.10 - 2018.3   Second semester

  • 電気情報工学実験Ⅰ

    2017.4 - 2017.9   First semester

  • 数値解析演習

    2017.4 - 2017.9   First semester

  • プログラミング演習

    2016.10 - 2017.3   Second semester

  • 電気情報工学実験Ⅰ

    2016.4 - 2016.9   First semester

  • 情報代数学演習

    2016.4 - 2016.9   First semester

  • 電気情報工学入門Ⅰ

    2016.4 - 2016.9   First semester

  • 情報代数学演習

    2015.4 - 2015.9   First semester

  • 電気情報工学実験Ⅰ

    2015.4 - 2015.9   First semester

  • 電気情報工学入門Ⅰ

    2015.4 - 2015.9   First semester

  • アルゴリズム論演習

    2014.4 - 2014.9   First semester

  • 電気情報工学入門Ⅰ

    2014.4 - 2014.9   First semester

  • プログラミング演習

    2014.4 - 2014.9   First semester

  • 情報学演習・情報学講究

    2013.4 - 2014.3   Full year

  • コアセミナー

    2013.4 - 2013.9   First semester

  • 電気情報工学実験Ⅰ

    2013.4 - 2013.9   First semester

  • 情報処理演習II

    2013.4 - 2013.9   First semester

  • アルゴリズム論演習

    2013.4 - 2013.9   First semester

  • 情報学演習・情報学講究

    2012.4 - 2013.3   Full year

  • 情報処理演習II

    2012.4 - 2012.9   First semester

  • コアセミナー

    2012.4 - 2012.9   First semester

  • アルゴリズム論演習

    2012.4 - 2012.9   First semester

  • 情報学演習・情報学講究

    2011.4 - 2012.3   Full year

  • 論理設計演習

    2011.4 - 2011.9   First semester

  • 情報処理演習II

    2011.4 - 2011.9   First semester

  • コアセミナー

    2011.4 - 2011.9   First semester

  • 電気情報工学実験１

    2011.4 - 2011.9   First semester

  • 情報処理演習I

    2010.10 - 2011.3   Second semester

  • 情報学演習・情報学講究

    2010.4 - 2011.3   Full year

  • 論理設計演習

    2010.4 - 2010.9   First semester

  • コアセミナー

    2010.4 - 2010.9   First semester

  • 電気情報工学実験１

    2010.4 - 2010.9   First semester

  • 情報学演習・情報学講究

    2009.4 - 2010.3   Full year

  • 知能システム学演習第二

    2009.4 - 2009.9   First semester

  • コアセミナー

    2009.4 - 2009.9   First semester

  • 情報処理演習II

    2009.4 - 2009.9   First semester

  • 電気情報工学実験１

    2009.4 - 2009.9   First semester

  • 論理設計演習

    2009.4 - 2009.9   First semester

  • 知能システム学演習第三

    2008.10 - 2009.3   Second semester

  • 知能システム学演習第一

    2008.10 - 2009.3   Second semester

  • 知能システム学演習第二

    2008.4 - 2008.9   First semester

  • コアセミナー

    2008.4 - 2008.9   First semester

  • 情報処理演習II

    2008.4 - 2008.9   First semester

  • 電気情報工学実験１

    2008.4 - 2008.9   First semester

  • 論理設計演習

    2008.4 - 2008.9   First semester

  • コアセミナー

    2007.4 - 2007.9   First semester

▼display all

FD Participation

  • 2024.3   Role：Participation   Title：【シス情FD】高度データサイエンティスト育成事業の取り組みについて

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2023.11   Role：Participation   Title：【シス情FD】企業等との共同研究の実施増加に向けて

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2023.9   Role：Participation   Title：【シス情FD】Top10%論文／Top10%ジャーナルとは何か: 傾向と対策

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2023.4   Role：Participation   Title：【シス情FD】若手教員による研究紹介⑧

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2023.1   Role：Participation   Title：【シス情FD】若手教員による研究紹介⑦

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2022.10   Role：Participation   Title：【シス情FD】若手教員による研究紹介⑥

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2022.6   Role：Participation   Title：【シス情FD】電子ジャーナル等の今後について

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2022.5   Role：Participation   Title：【シス情FD】若手教員による研究紹介④「量子コンピュータ・システム・アーキテクチャの研究～道具になることを目指して～」

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2022.1   Role：Participation   Title：【シス情FD】シス情関連の科学技術に対する国の政策動向（に関する私見）

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2021.10   Role：Participation   Title：【シス情FD】熊本高専と九大システム情報との交流・連携に向けて ー 3年半で感じた高専の実像 ー

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2021.6   Role：Participation   Title：若手教員による研究紹介　及び　科研取得のポイントについて　①

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2021.5   Role：Participation   Title：先導的人材育成フェローシップ事業(情報・AI分野)について

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2020.9   Role：Participation   Title：電気情報工学科総合型選抜（AO入試）について

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2020.7   Role：Participation   Title：アフターコロナの大学はどうあるべきか

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2020.5   Role：Participation   Title：オンサイト授業 vs. オンライン授業：分かったこと，変わったこと

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2020.4   Role：Participation   Title：新型コロナウイルスが誘起した社会変化に対する システム情報科学からの提言

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2020.2   Role：Participation   Title：九州大学工学系改組の現状と今後の予定

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2018.9   Role：Participation   Title：システム情報科学府 FD （教育の効率化について）

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2018.1   Role：Participation   Title：M2B（みつば）学習支援システム講習会

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2016.8   Role：Participation   Title：平成２８年度 工学部（府）、システム情報学府合同FD（ELITE(English Learning in Teacher English) プログラム研修報告）

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2014.10   Role：Participation   Title：半年経った基幹教育：振返りと今後に向けて

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2014.8   Role：Participation   Title：新GPA制度実施に向けたFD

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2014.1   Role：Participation   Title：第6回システム情報科学府FD

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2013.8   Role：Participation   Title：平成25年度システム情報科学研究院・学府第２回FD

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2013.4   Role：Participation   Title：平成25年度システム情報科学研究院・学府第１回FD

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2012.3   Role：Participation   Title：平成２３年度 第４回全学FD

    Organizer：University-wide

  • 2008.3   Role：Participation   Title：九州大学大学院システム情報科学府 第7回ファカルティ・ディベロップメント

    Organizer：[Undergraduate school/graduate school/graduate faculty]

  • 2007.4   Role：Participation   Title：平成１９年度第１回全学FD

    Organizer：University-wide

▼display all

Visiting, concurrent, or part-time lecturers at other universities, institutions, etc.

  • 2023  西南学院大学人間科学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・金曜５限

  • 2023  産業技術総合研究所  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：月２回

  • 2022  西南学院大学人間科学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・木曜4限

  • 2022  産業技術総合研究所  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：月２回

  • 2021  西南学院大学人間科学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・木曜4限

  • 2021  産業技術総合研究所  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：月２回

  • 2020  西南学院大学人間科学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・木曜4限、前期・木曜５限

  • 2020  産業技術総合研究所  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：月２回

  • 2019  西南学院大学人間科学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・木曜4限

  • 2018  西南学院大学人間科学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・木曜4限

  • 2017  西南学院大学人間科学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・木曜4限

  • 2016  西南学院大学人間科学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・木曜4限

  • 2016  九州情報大学経営情報学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：後期・水曜4,5限

  • 2015  九州情報大学経営情報学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：後期・金曜4,5限

  • 2015  近畿大学産業理工学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・水曜３，４限

  • 2015  西南学院大学人間科学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・木曜4,5限

  • 2014  近畿大学産業理工学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・水曜３，４限

  • 2013  近畿大学産業理工学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・水曜３，４限

  • 2012  近畿大学産業理工学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・水曜３，４限

  • 2011  近畿大学産業理工学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前後期・水曜３，４限

  • 2010  近畿大学産業理工学部  Classification:Part-time lecturer  Domestic/International Classification:Japan 

    Semester, Day Time or Duration：前期・水曜３，４限

▼display all

Social Activities

  • 平成２３年度高校生理数能力向上事業理数オリンピックセミナー

    福岡県教育委員会  2011.11

    　More details

    Audience：Infants,　Schoolchildren,　Junior students,　High school students

    Type：Seminar, workshop

  • 平成２２年度高校生理数能力向上事業理数オリンピックセミナー

    福岡県教育委員会  2010.11

    　More details

    Audience：Infants,　Schoolchildren,　Junior students,　High school students

    Type：Seminar, workshop

  • 「組込みシステム検証試験施設」開所式で， 〔連携検証施設「さつき」を利用した未解決ジョブショップスケージュリング問題の解決〕 について概要を述べた．

    （独）産業技術総合研究所  産業技術総合研究所 関西センター  2009.7

    　More details

    Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

    Type：Seminar, workshop

Acceptance of Foreign Researchers, etc.

  • Chalmers University of Technology, Sweden

    Acceptance period： 2010.2   （Period）：Less than 2 weeks

    Nationality：Sweden

    Business entity：On-campus funds

  • Chalmers University of Technology, Sweden

    Acceptance period： 2010.2   （Period）：Less than 2 weeks

    Nationality：Germany

    Business entity：On-campus funds

Travel Abroad

  • 2019.10 - 2019.11

    Staying countory name 1：Italy   Staying institution name 1：The 22nd International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2019)

  • 2019.8 - 2019.9

    Staying countory name 1：Fiji   Staying institution name 1：The 16th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2019)

  • 2017.11

    Staying countory name 1：United States   Staying institution name 1：The 29th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2017)

  • 2017.10 - 2017.11

    Staying countory name 1：France   Staying institution name 1：The 20th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2017)

  • 2012.11

    Staying countory name 1：Greece   Staying institution name 1：The 24th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2012)

  • 2011.7

    Staying countory name 1：Switzerland   Staying institution name 1：FTP 2011: International Workshop on First-Order Theorem Proving

  • 2010.7 - 2010.8

    Staying countory name 1：Canada   Staying institution name 1：2010 IEEE / WIC / ACM International Conferences on Web Intelligence and Intelligent Agent Technology

  • 2009.7

    Staying countory name 1：Norway   Staying institution name 1：FTP 2009: International Workshop on First-Order Theorem Proving

  • 2005.3

    Staying countory name 1：Other   Staying institution name 1：LPAR 2004: 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning

  • 2001.12

    Staying countory name 1：Cuba   Staying institution name 1：LPAR 2001: 8th International Conference on Logic for Programming, Artifical Intelligence and Reasoning,

  • 2000.11

    Staying countory name 1：France   Staying institution name 1：LPAR 2000: 7th International Conference on Logic for Programming and Automated Reasoning

  • 2000.8 - 2000.9

    Staying countory name 1：Australia   Staying institution name 1：PRICAI2000

  • 2000.7

    Staying countory name 1：United Kingdom   Staying institution name 1：TABLEAUX 2000

  • 1999.6

    Staying countory name 1：United States   Staying institution name 1：TABLEAUX'99

  • 1997.11

    Staying countory name 1：Germany   Staying institution name 1：University of Karlsruhe

▼display all