Knowledge Processing and Information Systems
Sebastian Schellhorn

M.Ed. Sebastian Schellhorn

University of Potsdam
Institute of Computer Science
An der Bahn 2
D-14476 Potsdam

Campus Golm, Building 70, Room 01.01

Phone   +49-331-977-3087
Email  seschell@cs.uni-potsdam.de

Publications

2025

  1. Dohrmann, C., Lucke, U., Schaub, T., & Schellhorn, S. (2025). AI-Based Tool for Curriculum-Based Course Timetabling at the University of Potsdam. In R. Vogl, L. Desnos, J.-F. Desnos, S. Bolis, L. Merakos, G. Ferrell, E. Tsili, & M. Roumeliotis (Eds.), Proceedings of EUNIS 2024 annual congress in Athens (Vol. 105, pp. 188–199). EasyChair. https://doi.org/10.29007/t32z [bib]

2024

  1. Hahn, S., Martens, C., Nemes, A., Otunuya, H., Romero, J., Schaub, T., & Schellhorn, S. (2024). Reasoning about Study Regulations in Answer Set Programming. CoRR, abs/2408.04528. [pdf] [bib]
  2. Hahn, S., Schaub, T., Martens, C., Nemes, A., Otunuya, H., Romero, J., & Schellhorn, S. (2024). Reasoning About Study Regulations in Answer Set Programming. Theory Pract. Log. Program., 24(4), 790–804. [bib]

2023

  1. Hahn, S., Martens, C., Nemes, A., Otunuya, H., Romero, J., Schaub, T., & Schellhorn, S. (2023). Reasoning about Study Regulations in Answer Set Programming (Preliminary Report). ICLP Workshops, 3437. [pdf] [bib]

2019

  1. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2019). Lower Bound Founded Logic of Here-and-There. JELIA, 11468, 509–525. [pdf] [bib]
  2. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2019). Gelfond-Zhang aggregates as propositional formulas. Artif. Intell., 274, 26–43. [pdf] [bib]
  3. Frioux, C., Schaub, T., Schellhorn, S., Siegel, A., & Wanko, P. (2019). Hybrid metabolic network completion. TPLP, 19(1), 83–108. [pdf] [bib]

2018

  1. Frioux, C., Schaub, T., Schellhorn, S., Siegel, A., & Wanko, P. (2018). Hybrid Metabolic Network Completion. CoRR, abs/1808.04149. [pdf] [bib]
  2. Gebser, M., Kaminski, R., Kaufmann, B., Lühne, P., Obermeier, P., Ostrowski, M., Romero, J., Schaub, T., Schellhorn, S., & Wanko, P. (2018). The Potsdam Answer Set Solving Collection 5.0. KI, 32(2-3), 181–182. [pdf] [bib]
  3. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2018). Lower Bound Founded Logic of Here-and-There: A Preliminary Report. NMR@KR, 31–41. [pdf] [bib]

2017

  1. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2017). Gelfond-Zhang Aggregates as Propositional Formulas. LPNMR, 10377, 117–131. [pdf] [bib]
  2. Frioux, C., Schaub, T., Schellhorn, S., Siegel, A., & Wanko, P. (2017). Hybrid Metabolic Network Completion. LPNMR, 10377, 308–321. [pdf] [bib]
  3. Janhunen, T., Kaminski, R., Ostrowski, M., Schaub, T., Schellhorn, S., & Wanko, P. (2017). clingo goes Linear Constraints over Reals and Integers. ASPOCP@LPNMR, 1868. [bib]
  4. Janhunen, T., Kaminski, R., Ostrowski, M., Schaub, T., Schellhorn, S., & Wanko, P. (2017). Clingo goes Linear Constraints over Reals and Integers. CoRR, abs/1707.04053. [pdf] [bib]
  5. Janhunen, T., Kaminski, R., Ostrowski, M., Schellhorn, S., Wanko, P., & Schaub, T. (2017). Clingo goes linear constraints over reals and integers. TPLP, 17(5-6), 872–888. [pdf] [bib]
  6. Schellhorn, S. (2017). Theory Reasoning with Answer Set Programming. DC@LPNMR, 31–34. [pdf] [bib]