Skip to main content

Personalized Course Schedule Planning Using Answer Set Programming

  • Conference paper
  • First Online:
Practical Aspects of Declarative Languages (PADL 2019)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 11372))

Included in the following conference series:

Abstract

Course scheduling or timetabling is a well-known problem that is generally studied from the perspective of schools; the goal is to schedule the courses, considering, e.g., the expected number of students, the sizes of the available classrooms, time conflicts between courses of the same category. We study a complementary problem to help the students during the course registration periods; the goal is to plan personalized course schedules for students, considering, e.g., their preferences over sections, instructors, distribution of the courses. We present a declarative method to compute personalized course schedules, and an application of this method using answer set programming, and discuss promising results of some preliminary user evaluations via surveys.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aini, I.F., Saptawijaya, A., Aminah, S.: Bringing answer set programming to the next level: a real case on modeling course timetabling. In: Proceedings of ICACSIS, pp. 471–476 (2017)

    Google Scholar 

  2. Ajanovski, V.V.: A personal mobile academic adviser. In: Daniel, F., Papadopoulos, G.A., Thiran, P. (eds.) MobiWIS 2013. LNCS, vol. 8093, pp. 300–303. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40276-0_25

    Chapter  Google Scholar 

  3. Ajanovski, V.V.: Curriculum mapping as a tool for improving students satisfaction with the choice of courses. In: Proceedings of ITiCSE, pp. 76–77 (2017)

    Google Scholar 

  4. Asín Achá, R., Nieuwenhuis, R.: Curriculum-based course timetabling with sat and maxsat. Ann. Oper. Res. 218(1), 71–91 (2014)

    Article  MathSciNet  Google Scholar 

  5. Banbara, M., et al.: teaspoon: solving the curriculum-based course timetabling problems with answer set programming. Ann. Oper. Res. (2018)

    Google Scholar 

  6. Banbara, M., Soh, T., Tamura, N., Inoue, K., Schaub, T.: Answer set programming as a modeling language for course timetabling. TPLP 13(4–5), 783–798 (2013)

    MathSciNet  MATH  Google Scholar 

  7. Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press, New York (2003)

    Book  Google Scholar 

  8. Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. ACM Communun. 54(12), 92–103 (2011)

    Article  Google Scholar 

  9. Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming: an introduction to the special issue. AI Mag. 37(3), 5–6 (2016)

    Article  Google Scholar 

  10. Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: the potsdam answer set solving collection. AI Comm. 24(2), 107–124 (2011)

    MathSciNet  MATH  Google Scholar 

  11. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP, pp. 1070–1080. MIT Press (1988)

    Google Scholar 

  12. Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach. Cambridge University Press, New York (2014)

    Book  Google Scholar 

  13. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365–385 (1991)

    Article  Google Scholar 

  14. Lifschitz, V.: Answer set programming and plan generation. AIJ 138, 39–54 (2002)

    MathSciNet  MATH  Google Scholar 

  15. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm. Artificial Intelligence, pp. 375–398. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-642-60085-2_17

    Chapter  MATH  Google Scholar 

  16. McCollum, B.: A perspective on bridging the gap between theory and practice in university timetabling. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 3–23. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77345-0_1

    Chapter  Google Scholar 

  17. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25, 241–273 (1999)

    Article  MathSciNet  Google Scholar 

  18. Schaerf, A.: A survey of automated timetabling. AI Rev. 13(2), 87–127 (1999)

    Google Scholar 

Download references

Acknowledgments

We thank the anonymous reviewers and the survey participants for useful comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Esra Erdem .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kahraman, M.K., Erdem, E. (2019). Personalized Course Schedule Planning Using Answer Set Programming. In: Alferes, J., Johansson, M. (eds) Practical Aspects of Declarative Languages. PADL 2019. Lecture Notes in Computer Science(), vol 11372. Springer, Cham. https://doi.org/10.1007/978-3-030-05998-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05998-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05997-2

  • Online ISBN: 978-3-030-05998-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics