論文 - 番原 睦則
-
aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming 査読有り
Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Max Ostrowski, Andrea Peano, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Matthias Weise
Proceedings of the 13th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2015), Lecture Notes in Artificial Intelligence 9345 巻 頁： 112-126 2015年9月
-
Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem 査読有り
Takehide Soh, Daniel Le Berre, Stephanie Roussel, Mutsunori Banbara, Naoyuki Tamura
Proceedings of the 14th European Conference on Logics in Artificial Intelligence (JELIA 2014), Lecture Notes in Artificial Intelligence 8761 巻 頁： 684-693 2014年9月
-
Answer Set Programming as a Modeling Language for Course Timetabling 査読有り
Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue and Torsten Schaub
Theory and Practice of Logic Programming 13 巻 ( 4-5 ) 頁： 783-798 2013年7月
-
A SAT-Based Method for Solving the Two-dimensional Strip Packing Problem 査読有り
Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara and Hidetomo Nabeshima
Fundamenta Informaticae 102 巻 ( 3-4 ) 頁： 467-487 2010年
-
Compiling finite linear CSP into SAT 査読有り
Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, and Mutsunori Banbara
CONSTRAINTS 14 巻 ( 2 ) 頁： 254-272 2009年6月
-
A Competitive and Cooperative Approach to Propositional Satisfiability 査読有り
Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, and Naoyuki Tamura
Discrete Applied Mathematics 154 巻 ( 16 ) 頁： 2291-2306 2006年11月