Model-based problem solving for university timetable validation and improvement

@article{Schneider2018ModelbasedPS,
  title={Model-based problem solving for university timetable validation and improvement},
  author={David Schneider and Michael Leuschel and Tobias Witt},
  journal={Formal Aspects of Computing},
  year={2018},
  volume={30},
  pages={545-569}
}
  • David Schneider, Michael Leuschel, Tobias Witt
  • Published in Formal Aspects of Computing 2018
  • Computer Science
  • 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 10 CITATIONS

    Formal Model-Based Constraint Solving and Document Generation

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND

    Towards Infinite-State Symbolic Model Checking for B and Event-B

    VIEW 2 EXCERPTS
    CITES RESULTS & BACKGROUND

    Using B and ProB for Data Validation Projects

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 37 REFERENCES

    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

    • M Leuschel, D Schneider
    • 2014

    AnimB 0 . 1 . 1

    • H Rudová
    • 2012