Knowledge Processing and Information Systems
Roland Kaminski

Roland Kaminski

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

Campus Golm, Building 70, Room 02.32

Phone   +49-331-977-3085
Fax   +49-331-977-3122
Email  kaminski@cs.uni-potsdam.de

Publications

2024

  1. Kaminski, R., Schaub, T., Strauch, K., & Svancara Jirı́. (2024). Improving the Sum-of-Cost Methods for Reduction-Based Multi-Agent Pathfinding Solvers. In ICAART (1) (pp. 264–271). SCITEPRESS. [bib]
  2. Svancara Jirı́, Atzmon, D., Strauch, K., Kaminski, R., & Schaub, T. (2024). Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends. In ICAART (3) (pp. 23–33). SCITEPRESS. [bib]
  3. 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]

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. In ICLP Workshops (Vol. 3437). CEUR-WS.org. [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]. In SOCS (pp. 185–186). AAAI Press. [bib]
  3. 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]
  4. Kaminski, R., & Schaub, T. (2023). On the Foundations of Grounding in Answer Set Programming. Theory Pract. Log. Program., 23(6), 1138–1197. [pdf] [bib]
  5. Kaminski, R. (2023). Complex reasoning with answer set programming (doctoralthesis). University of Potsdam. [pdf] [bib]

2022

  1. Hahn, S., Janhunen, T., Kaminski, R., Romero, J., Rühling, N., & Schaub, T. (2022). Plingo: A System for Probabilistic Reasoning in Clingo Based on LP^MLN. In RuleML+RR (Vol. 13752, pp. 54–62). Springer. [pdf] [bib]
  2. Hahn, S., Janhunen, T., Kaminski, R., Romero, J., Rühling, N., & Schaub, T. (2022). plingo: A system for probabilistic reasoning in clingo based on lpmln. CoRR, abs/2206.11515. [pdf] [bib]

2021

  1. Kaminski, R., & Schaub, T. (2021). On the Foundations of Grounding in Answer Set Programming. CoRR, abs/2108.04769. [pdf] [bib]

2020

  1. Kaminski, R., Romero, J., Schaub, T., & Wanko, P. (2020). How to build your own ASP-based system?! CoRR, abs/2008.06692. [pdf] [bib]
  2. Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., … Schaub, T. (2020). ASP-Core-2 Input Language Format. Theory Pract. Log. Program., 20(2), 294–309. [pdf] [bib]

2019

  1. Cabalar, P., Kaminski, R., Morkisch, P., & Schaub, T. (2019). telingo = ASP + Time. In LPNMR (Vol. 11481, pp. 256–269). Springer. [pdf] [bib]
  2. Everardo, F., Janhunen, T., Kaminski, R., & Schaub, T. (2019). The Return of xorro. In LPNMR (Vol. 11481, pp. 284–297). Springer. [pdf] [bib]
  3. Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., … Schaub, T. (2019). ASP-Core-2 Input Language Format. CoRR, abs/1911.04326. [pdf] [bib]
  4. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2019). Multi-shot ASP solving with clingo. TPLP, 19(1), 27–82. [pdf] [bib]

2018

  1. Razzaq, M., Kaminski, R., Romero, J., Schaub, T., Bourdon, J., & Guziolowski, C. (2018). Computing Diverse Boolean Networks from Phosphoproteomic Time Series Data. In CMSB (Vol. 11095, pp. 59–74). Springer. [pdf] [bib]
  2. Cabalar, P., Kaminski, R., Schaub, T., & Schuhmann, A. (2018). Temporal Answer Set Programming on Finite Traces. CoRR, abs/1804.10227. [pdf] [bib]
  3. Gebser, M., Kaminski, R., Kaufmann, B., Lühne, P., Obermeier, P., Ostrowski, M., … Wanko, P. (2018). The Potsdam Answer Set Solving Collection 5.0. KI, 32(2-3), 181–182. [pdf] [bib]
  4. Cabalar, P., Kaminski, R., Schaub, T., & Schuhmann, A. (2018). Temporal Answer Set Programming on Finite Traces. TPLP, 18(3-4), 406–420. [pdf] [bib]

2017

  1. Janhunen, T., Kaminski, R., Ostrowski, M., Schaub, T., Schellhorn, S., & Wanko, P. (2017). clingo goes Linear Constraints over Reals and Integers. In ASPOCP@LPNMR (Vol. 1868). CEUR-WS.org. [bib]
  2. Kaminski, R., Schaub, T., & Wanko, P. (2017). A Tutorial on Hybrid Answer Set Solving with clingo. In Reasoning Web (Vol. 10370, pp. 167–203). Springer. [pdf] [bib]
  3. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2017). Multi-shot ASP solving with clingo. CoRR, abs/1705.09811. [pdf] [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]

2016

  1. Gebser, M., Kaminski, R., Kaufmann, B., Lühne, P., Romero, J., & Schaub, T. (2016). Answer Set Solving with Generalized Learned Constraints. In ICLP (Technical Communications) (Vol. 52, pp. 9:1–9:15). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [pdf] [bib]
  2. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., & Wanko, P. (2016). Theory Solving Made Easy with Clingo 5. In ICLP (Technical Communications) (Vol. 52, pp. 2:1–2:15). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [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. Cabalar, P., Kaminski, R., Ostrowski, M., & Schaub, T. (2016). An ASP Semantics for Default Reasoning with Constraints. In IJCAI (pp. 1015–1021). IJCAI/AAAI Press. [pdf] [bib]
  5. Gebser, M., Janhunen, T., Kaminski, R., Schaub, T., & Tasharrofi, S. (2016). Writing Declarative Specifications for Clauses. In JELIA (Vol. 10021, pp. 256–271). [pdf] [bib]
  6. Gebser, M., Kaminski, R., & Schaub, T. (2016). Grounding Recursive Aggregates: Preliminary Report. CoRR, abs/1603.03884. [pdf] [bib]

2015

  1. Gebser, M., Kaminski, R., Obermeier, P., & Schaub, T. (2015). Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving. In Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (Vol. 9060, pp. 17–32). Springer. [pdf] [bib]
  2. Gebser, M., Janhunen, T., Jost, H., Kaminski, R., & Schaub, T. (2015). ASP Solving for Expanding Universes. In LPNMR (Vol. 9345, pp. 354–367). Springer. [pdf] [bib]
  3. Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., & Schaub, T. (2015). Progress in clasp Series 3. In LPNMR (Vol. 9345, pp. 368–383). Springer. [pdf] [bib]
  4. Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., & Schaub, T. (2015). Abstract Gringo. CoRR, abs/1507.06576. [bib]
  5. Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., & Schaub, T. (2015). Abstract gringo. TPLP, 15(4-5), 449–463. [pdf] [bib]
  6. Hoos, H. H., Kaminski, R., Lindauer, M. T., & Schaub, T. (2015). aspeed: Solver scheduling via answer set programming. TPLP, 15(1), 117–142. [pdf] [bib]
  7. Gebser, M., Janhunen, T., Kaminski, R., Schaub, T., & Tasharrofi, S. (2015). Writing Declarative Specifications for Clauses. In GTTV@LPNMR. [pdf] [bib]

2014

  1. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014). Clingo = ASP + Control: Preliminary Report. CoRR, abs/1405.3694. [bib]
  2. Hoos, H., Kaminski, R., Lindauer, M. T., & Schaub, T. (2014). Solver Scheduling via Answer Set Programming. CoRR, abs/1401.1024. [bib]
  3. Gebser, M., Janhunen, T., Kaminski, R., Schaub, T., & Tasharrofi, S. (2014). Declarative Encodings of Acyclicity Properties. In ASPOCP@LPNMR. [pdf] [bib]
  4. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014). Clingo = ASP + Control: Extended Report. University of Potsdam. [pdf] [bib]

2013

  1. Gebser, M., Jost, H., Kaminski, R., Obermeier, P., Sabuncu, O., Schaub, T., & Schneider, M. (2013). Ricochet Robots: A Transverse ASP Benchmark. In LPNMR (Vol. 8148, pp. 348–360). Springer. [pdf] [bib]
  2. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2013). Answer Set Programming for Stream Reasoning. CoRR, abs/1301.1392. [bib]
  3. Kaminski, R., Schaub, T., Siegel, A., & Videla, S. (2013). Minimal intervention strategies in logical signaling networks with ASP. TPLP, 13(4-5), 675–690. [pdf] [bib]

2012

  1. Hoos, H., Kaminski, R., Schaub, T., & Schneider, M. T. (2012). aspeed: ASP-based Solver Scheduling. In ICLP (Technical Communications) (Vol. 17, pp. 176–187). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [pdf] [bib]
  2. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2012). Stream Reasoning with Answer Set Programming: Preliminary Report. In KR. AAAI Press. [pdf] [bib]
  3. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2012). Answer Set Solving in Practice. Morgan & Claypool Publishers. [bib]
  4. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2012). Answer Set Programming for Stream Reasoning. In ASPOCP@LPNMR. [pdf] [bib]
  5. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2012). Stream Reasoning with Answer Set Programming: Extended Version. Unpublished draft. [bib]

2011

  1. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2011). Challenges in Answer Set Solving. In Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning (Vol. 6565, pp. 74–90). Springer. [pdf] [bib]
  2. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2011). Multi-Criteria Optimization in Answer Set Programming. In ICLP (Technical Communications) (Vol. 11, pp. 1–10). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [pdf] [bib]
  3. Gebser, M., Grote, T., Kaminski, R., & Schaub, T. (2011). Reactive Answer Set Programming. In LPNMR (Vol. 6645, pp. 54–66). Springer. [pdf] [bib]
  4. Gebser, M., Kaminski, R., König, A., & Schaub, T. (2011). Advances in gringo Series 3. In LPNMR (Vol. 6645, pp. 345–351). Springer. [pdf] [bib]
  5. Gebser, M., Kaminski, R., Knecht, M., & Schaub, T. (2011). plasp: A Prototype for PDDL-Based Planning in ASP. In LPNMR (Vol. 6645, pp. 358–363). Springer. [pdf] [bib]
  6. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., & Schnor, B. (2011). Cluster-Based ASP Solving with claspar. In LPNMR (Vol. 6645, pp. 364–369). Springer. [pdf] [bib]
  7. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M. T., & Ziller, S. (2011). A Portfolio Solver for Answer Set Programming: Preliminary Report. In LPNMR (Vol. 6645, pp. 352–357). Springer. [pdf] [bib]
  8. Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., & Schneider, M. T. (2011). Potassco: The Potsdam Answer Set Solving Collection. AI Commun., 24(2), 107–124. [pdf] [bib]
  9. Gebser, M., Kaminski, R., & Schaub, T. (2011). Complex Optimization in Answer Set Programming. CoRR, abs/1107.5742. [bib]
  10. Gebser, M., Kaminski, R., & Schaub, T. (2011). aspcud: A Linux Package Configuration Tool Based on Answer Set Programming. In LoCoCo (Vol. 65, pp. 12–25). [pdf] [bib]
  11. Gebser, M., Kaminski, R., & Schaub, T. (2011). Complex optimization in answer set programming. TPLP, 11(4-5), 821–839. [pdf] [bib]
  12. Gebser, M., Kaminski, R., & Schaub, T. (2011). Complex optimization in answer set programming: Extended Version. [pdf] [bib]
  13. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2011). Multi-Criteria Optimization in ASP and its Application to Linux Package Configuration. Unpublished draft. [pdf] [bib]

2009

  1. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2009). On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers. In ICLP (Vol. 5649, pp. 250–264). Springer. [pdf] [bib]
  2. Ellguth, E., Gebser, M., Gusowski, M., Kaufmann, B., Kaminski, R., Liske, S., … Schnor, B. (2009). A Simple Distributed Conflict-Driven Answer Set Solver. In LPNMR (Vol. 5753, pp. 490–495). Springer. [pdf] [bib]
  3. Gebser, M., Kaminski, R., Ostrowski, M., Schaub, T., & Thiele, S. (2009). On the Input Language of ASP Grounder Gringo. In LPNMR (Vol. 5753, pp. 502–508). Springer. [pdf] [bib]
  4. Schneidenbach, L., Schnor, B., Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2009). Experiences Running a Parallel Answer Set Solver on Blue Gene. In PVM/MPI (Vol. 5759, pp. 64–72). Springer. [pdf] [bib]

2008

  1. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., & Thiele, S. (2008). Engineering an Incremental ASP Solver. In ICLP (Vol. 5366, pp. 190–205). Springer. [pdf] [bib]