David Schneider
Skip Abstract Section
Abstract
Abstract
Constraint satisfaction problems can be expressed very elegantly in state-based formal methods such as B. But can such specifications be directly used for solving real-life problems? In other words, can a formal model be more than a design artefact but also be used at runtime for inference and problem solving? We will try and answer this important question in the present paper with regard to the university timetabling problem. We report on an ongoing project to build a curriculum timetable validation tool where we use a formal model as the basis to validate timetables from a student’s perspective and to support incremental modification of timetables. In this article we describe the problem domain, the formalization in B and our approach to execute the formal model in a production system using ProB.
- AAN12 Curriculum-based course timetabling with SAT and MaxSATAnn Oper Res201221817191322849510.1007/s10479-012-1081-x1301.90023Google Scholar
Cross Ref
- Abr05 The B-book. Assigning programs to meanings2005CambridgeCambridge University Press0915.68015Google Scholar
- BA08 Principles of the spin model checker2008BerlinSpringer1142.68044Google ScholarCross Ref
- BCD+13 Bendisposto J, Clark J, Dobrikov I, Körner P, Krings S, Ladenberger L, Leuschel M, Plagge D (2013) ProB 2.0 tutorial. In: Proceedings of the 4th Rodin user and developer workshop, TUCS lecture notes. TUCSGoogle Scholar
- BST+13 Answer set programming as a modeling language for course timetablingTheory Pract Log Program2013134–5783798315013710.1017/S14710684130004951286.68040Google ScholarCross Ref
- CHE05 Formalizing cardinality-based feature models and their specializationSoftw Process Improv Pract200510172910.1002/spip.213Google ScholarCross Ref
- CK05 Cooper TB, Kingston JH (2005) The complexity of timetable construction problems. In: PATAT, LNCS 1153. Springer, Berlin, pp 281–295Google Scholar
- Cle09 ClearSy. Atelier B, User and Reference Manuals. Aix-en-Provence, France, 2009. http://www.atelierb.eu/Google Scholar
- CO97 Carlsson M, Ottosson G (1997) An open-ended finite domain constraint solver. In: Glaser HG, Hartel PH, Kuchen H (eds) Proceedings PLILP’97, LNCS 1292. Springer, Berlin, pp. 191–206Google Scholar
- CRF95 Evolving timetablesPract Handb Genet algorithms Appl19951219276Google Scholar
- DdM06 Dutertre B, Mendonça de Moura L (2006) A fast linear-arithmetic solver for DPLL(T). In: Ball T, Jones RB (eds) Proceedings CAV’06, LNCS 4144. Springer, Berlin, pp 81–94Google Scholar
- DFGV12 Deharbe D, Fontaine P, Guyot Y, Voisin L (2012) SMT solvers for Rodin. In: Proceedings ABZ’2012, LNCS 7316. Springer, Berlin, pp 194–207Google Scholar
- DGMS07 Di Gaspero L, McCollum B, Schaerf A (2007) The second international timetabling competition (ITC-2007): curriculum-based course timetabling (Track 3). In: Proceedings of the 14th RCRA workshop on experimental evaluation of algorithms for solving problems with combinatorial explosion, RomeGoogle Scholar
- dMB08 de Moura LM, Bjørner N (2008) Z3: an efficient SMT solver. In: Ramakrishnan CR, Rehof J (eds) TACAS, LNCS 4963. Springer, Berlin, pp 337–340Google Scholar
- DOO00 Timetable planning using the constraint-based reasoningComput Oper Res200027981984010.1016/S0305-0548(99)00051-90957.90078Google ScholarDigital Library
- FGG07 CoreASM: an extensible ASM execution engineFundam Inform2007771–27110323292741118.68544Google ScholarDigital Library
- Got63 Gotlieb CC (1963) The construction of class-teacher timetables. In: Preprint of the proceedings of the IFIP congress 62/Munich, August 27, pp 22–25Google Scholar
- Hol04 The SPIN model checker—primer and reference manual2004BostonAddison-WesleyGoogle Scholar
- HSL16 Hansen D, Schneider D, Leuschel M (2016) Using B and ProB for data validation projects. In: Proceedings ABZ 2016, LNCS. Springer, BerlinGoogle Scholar
- Jac02 Alloy: a lightweight object modelling notationACM Trans Softw Eng Methodol20021125629010.1145/505145.505149Google ScholarDigital Library
- Jac12 Software abstractions. Logic, language, and analysis2012LondonMIT PressGoogle Scholar
- JM94 Constraint logic programming: a surveyJ Log Program199419-20503581127993410.1016/0743-1066(94)90033-70900.68127Google Scholar
- KCH+90 Kang KC, Cohen SG, Hess JA, Novak WE, Peterson AS (1990) Feature-oriented domain analysis (FODA) feasibility study. Technical Report CMU/SEI-90-TR-21, Caregie-Mellon University-Software Engineering Insititue, PittsburghGoogle Scholar
- Lew08 A survey of metaheuristic-based techniques for university timetabling problemsOR Spectr2008301167190237294410.1007/s00291-007-0097-01133.90341Google ScholarCross Ref
- LFFP11 Automated property verification for large scale B models with ProBFormal Asp Comput2011236683709285377010.1007/s00165-010-0172-1Google ScholarDigital Library
- LL10 Lach G, Lübbecke ME (February 2010) Curriculum based course timetabling: new solutions to Udine benchmark instances. Ann Oper Res 194(1):255–272Google Scholar
- LS14 Leuschel M, Schneider D (2014) Towards B as a high-level constraint modelling language. In: Yamine AA, Klaus-Dieter S (eds) Abstract state machines, alloy, B, TLA, VDM, and Z, volume 8477 of Lecture Notes in computer science. Springer, BerlinGoogle Scholar
- Mét10 Métayer C (2010) AnimB 0.1.1. http://wiki.event-b.org/index.php/AnimBGoogle Scholar
- MR12 Müller T, Rudová H (2012) Real-life curriculum-based Timetabling. PATATGoogle Scholar
- MR14 Müller T, Rudová H (2014) Real-life curriculum-based timetabling with elective courses and course sections. Ann Oper Res 1–18Google Scholar
- Mül05 Müller T (2005) Constraint-based timetabling. Ph.D. thesis, Charles University in PragueGoogle Scholar
- PDGKM13 The third international timetabling competitionAnn Oper Res20132013171336.90081Google Scholar
- PL12 Plagge D, Leuschel M (2012) Validating B, Z and TLA+ using ProB and Kodkod. In: Dimitra G, Dominique M (eds) Proceedings FM’2012, LNCS 7436. Springer, Berlin, pp 372–386Google Scholar
- RM03 Rudová H, Murray K (2003) University course timetabling with soft constraints. In: Edmund B, De Causmaecker P (eds) PATAT IV, LNCS 2740. Springer, Berlin, pp 310–328Google Scholar
- SH06 Application of a real-world university-course timetabling model solved by integer programmingOR Spect200629478380310.1007/s00291-006-0074-z1168.90670Google ScholarCross Ref
- Sha11 Shapiro SC (2011) The jobs puzzle: a challenge for logical expressibility and automated reasoning. In: AAAI spring symposium: logical formalizations of commonsense reasoningGoogle Scholar
- TCJ08 Torlak E, Chang FS, Jackson D (2008) Finding minimal unsatisfiable cores of declarative specifications. In: Cuéllar J, Maibaum TSE, Sere K (eds) Proceedings FM’2008, pp 326–341Google Scholar
- TJ07 Torlak E, Jackson D (2007) Kodkod: a relational model finder. In: Grumberg O, Huth M (eds) Proceedings TACAS’07, LNCS 4424. Springer, Berlin, pp 632–647Google Scholar
- Yeu06 Vincent SHY (2006) Declarative configuration applied to course scheduling. Master’s thesis, Massachusetts Institute of Technology, Massachusetts Institute Of TechnologyGoogle Scholar
- YML99 Yu Y, Manolios P, Lamport L (1999) Model checking TLA+ specifications. In: Laurence P, Thomas K (eds) Proceedings CHARME’99, LNCS 1703. Springer, pp 54–66Google Scholar
Index Terms
- Model-based problem solving for university timetable validation and improvement
Index terms have been assigned to the content through auto-classification.
Recommendations
Minimizing the makespan in a flow shop environment under minimum and maximum time-lag constraints
Highlights- Flow shop problem with minimum and maximum time-lag constraints is studied.
- A ...
AbstractThis paper considers the flow shop scheduling problem with minimum and maximum time-lag requirements. According to the time-lag constraints, the starting time of each operation of a job must be within a specified time-window after the ...
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which ...
A survey of Particle Swarm Optimization techniques for solving university Examination Timetabling Problem
The university Examination Timetabling Problem is one of the most important scheduling problems that numerous educational organizations have to find out a solution to manage their examinations by assigning these events to particular timeslots, rooms and/...
Comments