TY  - GEN
A1  - Banbara, Mutsunori
A1  - Soh, Takehide
A1  - Tamura, Naoyuki
A1  - Inoue, Katsumi
A1  - Schaub, Torsten H.
T1  - Answer set programming as a modeling language for course timetabling
T2  - Postprints der Universität Potsdam : Mathematisch Naturwissenschaftliche Reihe
N2  - The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds.
T3  - Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe - 594 
KW  - answer set programming
KW  - educational timetabling
KW  - course timetabling
Y1  - 2019
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-415469
SN  - 1866-8372
IS  - 594
SP  - 783
EP  - 798
ER  - 
TY  - GEN
A1  - Kaminski, Roland
A1  - Schaub, Torsten H.
A1  - Siegel, Anne
A1  - Videla, Santiago
T1  - Minimal intervention strategies in logical signaling networks with ASP
T2  - Postprints der Universität Potsdam : Mathematisch Naturwissenschaftliche Reihe
N2  - Proposing relevant perturbations to biological signaling networks is central to many problems in biology and medicine because it allows for enabling or disabling certain biological outcomes. In contrast to quantitative methods that permit fine-grained (kinetic) analysis, qualitative approaches allow for addressing large-scale networks. This is accomplished by more abstract representations such as logical networks. We elaborate upon such a qualitative approach aiming at the computation of minimal interventions in logical signaling networks relying on Kleene's three-valued logic and fixpoint semantics. We address this problem within answer set programming and show that it greatly outperforms previous work using dedicated algorithms.
T3  - Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe - 596 
KW  - systems biology
KW  - transduction
KW  - circuits
KW  - models
KW  - sets
Y1  - 2019
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-415704
SN  - 1866-8372
IS  - 4-5
SP  - 675
EP  - 690
ER  -