teaspoon: Solving the Curriculum-Based Course Timetabling Problems with Answer Set Programming
Mutsunori Banbara, Katsumi Inoue, Benjamin Kaufmann, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Philipp Wanko
Proceedings of the 11th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2016), pp.13-32, 2016.
A Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings
Takehide Soh, Mutsunori Banbara, Naoyuki Tamura
Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2015), pp.421--428, IEEE Computer Society, 2015.
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, and Matthias Weise.
In: Francesco Calimeri, Giovambattista Ianni, and Miroslaw Truszczynski (eds.),
Proceedings of the 13th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2015),
Lecture Notes in Artificial Intelligence, Vol.9345, pp.112-126, Springer, 2015.
Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem.
Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara and Naoyuki Tamura.
In: Eduardo Fermé and Joäo Leite (eds.), Proceedings of the 14th European Conference on Logics in Artificial Intelligence (JELIA 2014),
Lecture Notes in Artificial Intelligence, Vol.8761, pp.684-693, Springer, 2014.
PBSugar: Compiling Pseudo-Boolean Constraints to SAT with Order Encoding.
Naoyuki Tamura, Mutsunori Banbara, and Takehide Soh.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2013), pp. 1020-1027, IEEE Computer Society, 2013. DOI 10.1109/ICTAI.2013.153
Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Torsten Schaub, Takehide Soh, Naoyuki Tamura and Matthias Weise
In the Proceedings of Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP), Istanbul, August 2013.
PBSugar: Compiling Pseudo-Boolean Constraints to SAT with Order Encoding
Naoyuki Tamura, Mutsunori Banbara and Takehide Soh
In the Proceedings of Pragmatics of SAT 2013 (PoS-13), 14 pages, July 2013.
System Architecture and Implementation of a Prototyping Tool for SAT-based Constraint Programming Systems
Takehide Soh, Naoyuki Tamura, Mutsunori Banbara, Daniel Le Berre, and Stéphanie Roussel
In the Proceedings of Pragmatics of SAT 2013 (PoS-13), 14 pages, July 2013.
Scarab: A Rapid Prototyping Tool for SAT-based Constraint Programming Systems (Tool Paper)
Takehide Soh, Naoyuki Tamura, and Mutsunori Banbara
In the Proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing (SAT 2013), LNCS 7962, pp. 429-436, 2013.
Predicting Gene Knockout Effects by Minimal Pathway Enumeration
Proceedings of The 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, No.16 (15 pages), CEUR Workshop Proceedings (CEUR-WS.org), Vol.451, 2008.
Lemma Reusing for SAT based Planning and Scheduling
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, and Koji Iwanuma
In the proceedings of the International Conference on Automated Planning and Scheduling 2006 (ICAPS 2006), pages 103-112, AAAI Press, 2006.
Experimental Results for Solving Job-shop Scheduling Problems with Multiple SAT Solvers
Takehide Soh, Katsumi Inoue, Mutsunori Banbara, and Naoyuki Tamura
In the Proceedings of the 1st International Workshop on Distributed and Speculative Constraint Processing (held in conjunction with CP 2005), pages 25-38, Sitges Spain, October 1st 2005.
