Knowledge Processing and Information Systems
Philipp Wanko

M.S. Philipp Wanko

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

Campus Golm, Building 70, Room 02.10

Phone   +49-331-977-3083
Email  wanko@uni-potsdam.de

Publications

2025

  1. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2025). Strong Equivalence in Answer Set Programming with Constraints. CoRR, abs/2502.04302. [pdf] [bib]
  2. Baumeister, J., Hahn, S., Herud, K., Ostrowski, M., Reutelshöfer, J., Rühling, N., Schaub, T., & Wanko, P. (2025). Towards Industrial-scale Product Configuration. CoRR, abs/2504.00013. [pdf] [bib]

2024

  1. Baumeister, J., Herud, K., Ostrowski, M., Reutelshöfer, J., Rühling, N., Schaub, T., & Wanko, P. (2024). Towards Industrial-Scale Product Configuration. LPNMR, 15245, 71–84. [bib]
  2. Kaminski, R., Schaub, T., Son, T. C., Svancara Jirı́, & Wanko, P. (2024). Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report. CoRR, abs/2403.12153. [pdf] [bib]
  3. Müller, L., Wanko, P., Haubelt, C., & Schaub, T. (2024). Investigating Methods for ASPmT-Based Design Space Exploration in Evolutionary Product Design. Int. J. Parallel Program., 52(1), 59–92. [bib]

2023

  1. Behrens, J., Kaminski, R., Schaub, T., Son, T. C., Svancara, J., & Wanko, P. (2023). Routing and Scheduling in different ways: Abridged Preliminary Report. ICLP Workshops, 3437. [pdf] [bib]
  2. Svancara Jirı́, Tignon, E., Barták, R., Schaub, T., Wanko, P., & Kaminski, R. (2023). Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]. SOCS, 185–186. [bib]
  3. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2023). On the Semantics of Hybrid ASP Systems Based on Clingo. Algorithms, 16(4), 185. [pdf] [bib]
  4. Haubelt, C., Müller, L., Neubauer, K., Schaub, T., & Wanko, P. (2023). Evolutionary System Design with Answer Set Programming. Algorithms, 16(4), 179. [pdf] [bib]
  5. Rajaratnam, D., Schaub, T., Wanko, P., Chen, K., Liu, S., & Son, T. C. (2023). Solving an Industrial-Scale Warehouse Delivery Problem with Answer Set Programming Modulo Difference Constraints. Algorithms, 16(4), 216. [pdf] [bib]
  6. Kaminski, R., Romero, J., Schaub, T., & Wanko, P. (2023). How to Build Your Own ASP-based System?! Theory Pract. Log. Program., 23(1), 299–361. [pdf] [bib]

2021

  1. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2021). Towards a Semantics for Hybrid ASP systems. CoRR, abs/2108.03061. [pdf] [bib]
  2. Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., & Wanko, P. (2021). Train Scheduling with Hybrid Answer Set Programming. Theory Pract. Log. Program., 21(3), 317–347. [bib]

2020

  1. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). An ASP Semantics for Constraints Involving Conditional Aggregates. ECAI, 325, 664–671. [pdf] [bib]
  2. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. KR, 193–202. [pdf] [bib]
  3. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). An ASP semantics for Constraints involving Conditional Aggregates. CoRR, abs/2002.06911. [pdf] [bib]
  4. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. CoRR, abs/2003.04176. [pdf] [bib]
  5. Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., & Wanko, P. (2020). Train Scheduling with Hybrid Answer Set Programming. CoRR, abs/2003.08598. [pdf] [bib]
  6. Kaminski, R., Romero, J., Schaub, T., & Wanko, P. (2020). How to build your own ASP-based system?! CoRR, abs/2008.06692. [pdf] [bib]

2019

  1. Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., & Wanko, P. (2019). Train Scheduling with Hybrid ASP. LPNMR, 11481, 3–17. [pdf] [bib]
  2. Banbara, M., Inoue, K., Kaufmann, B., Okimoto, T., Schaub, T., Soh, T., Tamura, N., & Wanko, P. (2019). teaspoon : solving the curriculum-based course timetabling problems with answer set programming. Annals OR, 275(1), 3–37. [pdf] [bib]
  3. Wanko, P. (2019). Design Space Exploration via Answer Set Programming Modulo Theories. CoRR, abs/1905.05248. [bib]
  4. Frioux, C., Schaub, T., Schellhorn, S., Siegel, A., & Wanko, P. (2019). Hybrid metabolic network completion. TPLP, 19(1), 83–108. [pdf] [bib]

2018

  1. Neubauer, K., Haubelt, C., Wanko, P., & Schaub, T. (2018). Utilizing quad-trees for efficient design space exploration with partial assignment evaluation. ASP-DAC, 434–439. [pdf] [bib]
  2. Neubauer, K., Haubelt, C., Wanko, P., & Schaub, T. (2018). On leveraging approximations for exact system-level design space exploration: work-in-progress. CODES+ISSS, 15:1–15:2. [pdf] [bib]
  3. Neubauer, K., Wanko, P., Schaub, T., & Haubelt, C. (2018). Exact multi-objective design space exploration using ASPmT. DATE, 257–260. [pdf] [bib]
  4. Neubauer, K., Haubelt, C., Wanko, P., & Schaub, T. (2018). Systematic Test Case Instance Generation for the Assessment of System-level Design Space Exploration Approaches. MBMV. [bib]
  5. Frioux, C., Schaub, T., Schellhorn, S., Siegel, A., & Wanko, P. (2018). Hybrid Metabolic Network Completion. CoRR, abs/1808.04149. [pdf] [bib]
  6. 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]
  7. Haubelt, C., Neubauer, K., Schaub, T., & Wanko, P. (2018). Design Space Exploration with Answer Set Programming. KI, 32(2-3), 205–206. [pdf] [bib]

2017

  1. Neubauer, K., Wanko, P., Schaub, T., & Haubelt, C. (2017). Enhancing symbolic system synthesis through ASPmT with partial assignment evaluation. DATE, 306–309. [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. Kaminski, R., Schaub, T., & Wanko, P. (2017). A Tutorial on Hybrid Answer Set Solving with clingo. Reasoning Web, 10370, 167–203. [pdf] [bib]
  5. 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]
  6. 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]

2016

  1. Romero, J., Schaub, T., & Wanko, P. (2016). Computing Diverse Optimal Stable Models. ICLP (Technical Communications), 52, 3:1–3:14. [pdf] [bib]
  2. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., & Wanko, P. (2016). Theory Solving Made Easy with Clingo 5. ICLP (Technical Communications), 52, 2:1–2:15. [pdf] [bib]
  3. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., & Wanko, P. (2016). Theory Solving Made Easy with Clingo 5 (Extended Version). [pdf] [bib]
  4. Wanko, P. (2016). Scalable Design Space Exploration via Answer Set Programming. ICLP (Technical Communications), 52, 23:1–23:11. [bib]
  5. Banbara, M., Inoue, K., Kaufmann, B., Schaub, T., Soh, T. C., Tamura, N., & Wanko, P. (2016). teaspoon: Solving the Curriculum-Based Course Timetabling Problems with Answer Set Programming. PATAT, 13–32. [pdf] [bib]

2013

  1. Gebser, M., Kaufmann, B., Romero, J., Otero, R., Schaub, T., & Wanko, P. (2013). Domain-Specific Heuristics in Answer Set Programming. AAAI. [pdf] [bib]