$${\varvec{teaspoon}}$$: solving the curriculum-based course timetabling problems with answer set programming

Autor: Naoyuki Tamura, Takehide Soh, Mutsunori Banbara, Torsten Schaub, Philipp Wanko, Benjamin Kaufmann, Tenda Okimoto, Katsumi Inoue

Publikováno v: Annals of Operations Research. 275:3-37

Answer Set Programming (ASP) is an approach to declarative problem solving, combining a rich yet simple modeling language with high performance solving capacities. We here develop an ASP-based approach to curriculum-based course timetabling (CB-CTT),

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8949189320fdc771426bc3edc3327f43
https://doi.org/10.1007/s10479-018-2757-7

Finding Minimal Reaction Sets in Large Metabolic Pathways

Autor: Takehide Soh, Katsumi Inoue

Publikováno v: EPiC Series in Computing.

In systems biology, identifying vital functions like glycolysis from a given metabolic pathway is important to understand living organisms. In this paper, we particularly focus on the problem of finding minimal sub-pathways producing target metabolit

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0147259f9dbb2802080f49cb46e98897
https://doi.org/10.29007/xp2k

catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming

Autor: Takehide Soh, Hiromasa Kaneyuki, Naoyuki Tamura, Katsumi Inoue, Torsten Schaub, Tenda Okimoto, Mutsunori Banbara

Publikováno v: Logic Programming and Nonmonotonic Reasoning ISBN: 9783319616599
LPNMR

We develop an approach to test suite generation for Constrained Combinatorial Testing (CCT), one of the most widely studied combinatorial testing techniques, based on Answer Set Programming (ASP). The resulting catnap system accepts a CCT instance in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::46bd9e45e560bd330a3219fa94c4fdc6
https://doi.org/10.1007/978-3-319-61660-5_24

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

Autor: Naoyuki Tamura, Katsumi Inoue, Mutsunori Banbara, Takehide Soh, Hidetomo Nabeshima

Publikováno v: Scopus-Elsevier

We propose a satisfiability testing (SAT) based exact approach for solving the two-dimensional strip packing problem (2SPP). In this problem, we are given a set of rectangles and one large rectangle called a strip. The goal of the problem is to pack

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0354e51c8eb9ae219eb06b17a6b7298
https://doi.org/10.3233/fi-2010-314

aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming

Autor: Torsten Schaub, Andrea Peano, Martin Gebser, Max Ostrowski, Naoyuki Tamura, Katsumi Inoue, Mutsunori Banbara, Matthias Weise, Takehide Soh

Publikováno v: Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15)
Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), Sep 2015, Lexington, United States. pp.112-126, ⟨10.1007/978-3-319-23264-5_10⟩
Logic Programming and Nonmonotonic Reasoning ISBN: 9783319232638
LPNMR

International audience; Encoding finite linear CSPs as Boolean formulas and solving them byusing modern SAT solvers has proven to be highly effective by the award-winningsugar system. We here develop an alternative approach based on ASP that servestw

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74c0cd7b173f18210a95bbe8881a3fdc
https://inria.hal.science/hal-01186996