Papers - BANBARA Mutsunori
-
aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming Reviewed
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 Vol. 9345 page： 112-126 2015.9
-
Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem Reviewed
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 Vol. 8761 page： 684-693 2014.9
-
Answer Set Programming as a Modeling Language for Course Timetabling Reviewed
Mutsunori Banbara, Takehide Soh, Naoyuki Tamura, Katsumi Inoue and Torsten Schaub
Theory and Practice of Logic Programming Vol. 13 ( 4-5 ) page： 783-798 2013.7
-
A SAT-Based Method for Solving the Two-dimensional Strip Packing Problem Reviewed
Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara and Hidetomo Nabeshima
Fundamenta Informaticae Vol. 102 ( 3-4 ) page： 467-487 2010
-
Compiling finite linear CSP into SAT Reviewed
Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, and Mutsunori Banbara
CONSTRAINTS Vol. 14 ( 2 ) page： 254-272 2009.6
-
A Competitive and Cooperative Approach to Propositional Satisfiability Reviewed
Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito Sasaura, Mutsunori Banbara, and Naoyuki Tamura
Discrete Applied Mathematics Vol. 154 ( 16 ) page： 2291-2306 2006.11