Dr. Martin Gebser

University of Potsdam
Institute of Computer Science
August-Bebel-Str. 89
D-14482 Potsdam

Office complex III, House 4, Room 02.11
directly at the Griebnitzsee S-Bahn station

Phone   +49-331-977-3091
Fax   +49-331-977-3122
Email  gebser@cs.uni-potsdam.de
Homepage  Homepage

Publications

2019

  1. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2019). Multi-shot ASP solving with clingo. TPLP, 19(1), 27–82. [pdf] [bib]
  2. Dimopoulos, Y., Gebser, M., Lühne, P., Romero, J., & Schaub, T. (2019). plasp 3: Towards Effective ASP Planning. TPLP, 19(3), 477–504. [pdf] [bib]
  3. Gebser, M., Maratea, M., & Ricca, F. (2019). The Seventh Answer Set Programming Competition: Design and Results. CoRR, abs/1904.09134. [bib]

2018

  1. Schäpers, B., Niemueller, T., Lakemeyer, G., Gebser, M., & Schaub, T. (2018). ASP-Based Time-Bounded Planning for Logistics Robots. In ICAPS (pp. 509–517). AAAI Press. [pdf] [bib]
  2. Gebser, M., Leone, N., Maratea, M., Perri, S., Ricca, F., & Schaub, T. (2018). Evaluation Techniques and Systems for Answer Set Programming: a Survey. In IJCAI (pp. 5450–5456). ijcai.org. [bib]
  3. Gebser, M., Obermeier, P., Otto, T., Schaub, T., Sabuncu, O., Nguyen, V., & Son, T. C. (2018). Experimenting with robotic intra-logistics domains. CoRR, abs/1804.10247. [pdf] [bib]
  4. Gebser, M., Obermeier, P., Otto, T., Schaub, T., Sabuncu, O., Nguyen, V., & Son, T. C. (2018). Experimenting with robotic intra-logistics domains. TPLP, 18(3-4), 502–519. [pdf] [bib]
  5. Bobda, C., Yonga, F., Gebser, M., Ishebabi, H., & Schaub, T. (2018). High-level synthesis of on-chip multiprocessor architectures based on answer set programming. J. Parallel Distrib. Comput., 117, 161–179. [bib]
  6. Dimopoulos, Y., Gebser, M., Lühne, P., Romero, J., & Schaub, T. (2018). plasp 3: Towards Effective ASP Planning. CoRR, abs/1812.04491. [pdf] [bib]
  7. Gebser, M., Obermeier, P., Ratsch-Heitmann, M., Runge, M., & Schaub, T. (2018). Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming. CoRR, abs/1804.10437. [pdf] [bib]
  8. Gebser, M., Obermeier, P., Schaub, T., Ratsch-Heitmann, M., & Runge, M. (2018). Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming. TPLP, 18(3-4), 520–534. [pdf] [bib]
  9. 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]

2017

  1. Janhunen, T., Gebser, M., Rintanen, J., Nyman, H. J., Pensar, J., & Corander, J. (2017). Learning discrete decomposable graphical models via constraint optimization. Statistics and Computing, 27(1), 115–130. [pdf] [bib]
  2. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2017). Multi-shot ASP solving with clingo. CoRR, abs/1705.09811. [pdf] [bib]
  3. Dimopoulos, Y., Gebser, M., Lühne, P., Romero, J., & Schaub, T. (2017). plasp 3: Towards Effective ASP Planning. In LPNMR (Vol. 10377, pp. 286–300). Springer. [pdf] [bib]
  4. Gebser, M., Maratea, M., & Ricca, F. (2017). The Design of the Seventh Answer Set Programming Competition. In LPNMR (Vol. 10377, pp. 3–9). Springer. [pdf] [bib]
  5. Gebser, M., Maratea, M., & Ricca, F. (2017). The Sixth Answer Set Programming Competition. J. Artif. Intell. Res., 60, 41–95. [pdf] [bib]

2016

  1. Becker, K., Bockmayer, A., Gebser, M., & Schaub, T. (2016). Answer Set Programming for Logical Analysis of Data. In WCB@CP (pp. 15–26). [bib]
  2. Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., & Schaub, T. (2016). Answer Set Programming Modulo Acyclicity. Fundam. Inform., 147(1), 63–91. [pdf] [bib]
  3. 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]
  4. Gebser, M., Janhunen, T., & Rintanen, J. (2016). Declarative Encodings of Acyclicity Properties. Journal of Logic and Computation. [pdf] [bib]
  5. Calimeri, F., Gebser, M., Maratea, M., & Ricca, F. (2016). Design and results of the Fifth Answer Set Programming Competition. Artif. Intell., 231, 151–181. [pdf] [bib]
  6. Alviano, M., Faber, W., & Gebser, M. (2016). From Non-Convex Aggregates to Monotone Aggregates in ASP. In IJCAI (pp. 4100–4194). IJCAI/AAAI Press. [pdf] [bib]
  7. Gebser, M., Kaminski, R., & Schaub, T. (2016). Grounding Recursive Aggregates: Preliminary Report. CoRR, abs/1603.03884. [pdf] [bib]
  8. Gebser, M., Guyet, T., Quiniou, R., Romero, J., & Schaub, T. (2016). Knowledge-Based Sequence Mining with ASP. In IJCAI (pp. 1497–1504). IJCAI/AAAI Press. [pdf] [bib]
  9. Gebser, M., & Schaub, T. (2016). Modeling and Language Extensions. AI Magazine, 37(3), 33–44. [pdf] [bib]
  10. Bomanson, J., Gebser, M., & Janhunen, T. (2016). Rewriting Optimization Statements in Answer-Set Programs. In ICLP (Technical Communications) (Vol. 52, pp. 5:1–5:15). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [pdf] [bib]
  11. Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2016). Shift Design with Answer Set Programming. Fundam. Inform., 147(1), 1–25. [pdf] [bib]
  12. 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]
  13. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., & Wanko, P. (2016). Theory Solving Made Easy with Clingo 5 (Extended Version). [pdf] [bib]
  14. Gebser, M., Maratea, M., & Ricca, F. (2016). What’s Hot in the Answer Set Programming Competition. In AAAI (pp. 4327–4329). AAAI Press. [bib]
  15. 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]

2015

  1. Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., & Schaub, T. (2015). Abstract Gringo. CoRR, abs/1507.06576. [bib]
  2. Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., & Schaub, T. (2015). Abstract gringo. TPLP, 15(4-5), 449–463. [pdf] [bib]
  3. Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., & Schaub, T. (2015). Answer Set Programming Modulo Acyclicity. In LPNMR (Vol. 9345, pp. 143–150). Springer. [pdf] [bib]
  4. Banbara, M., Gebser, M., Inoue, K., Ostrowski, M., Peano, A., Schaub, T., … Weise, M. (2015). aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. In LPNMR (Vol. 9345, pp. 112–126). Springer. [pdf] [bib]
  5. Gebser, M., Ryabokon, A., & Schenner, G. (2015). Combining Heuristics for Configuration Problems Using Answer Set Programming. In LPNMR (Vol. 9345, pp. 384–397). Springer. [pdf] [bib]
  6. Gebser, M., Obermeier, P., & Schaub, T. (2015). Interactive Answer Set Programming - Preliminary Report. CoRR, abs/1511.01261. [pdf] [bib]
  7. Videla, S., Guziolowski, C., Eduati, F., Thiele, S., Gebser, M., Nicolas, J., … Siegel, A. (2015). Learning Boolean logic models of signaling networks with ASP. Theor. Comput. Sci., 599, 79–101. [pdf] [bib]
  8. 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]
  9. Alviano, M., Faber, W., & Gebser, M. (2015). Rewriting recursive aggregates in answer set programming: back to monotonicity. CoRR, abs/1507.03923. [bib]
  10. Alviano, M., Faber, W., & Gebser, M. (2015). Rewriting recursive aggregates in answer set programming: back to monotonicity. TPLP, 15(4-5), 559–573. [pdf] [bib]
  11. 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]
  12. Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In LPNMR (Vol. 9345, pp. 32–39). Springer. [pdf] [bib]
  13. Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In ASPOCP@LPNMR. [pdf] [bib]
  14. Gebser, M., Ryabokon, A., & Schenner, G. (2015). Solving combined configuration problems: a heuristic approach. In Configuration Workshop (Vol. 1453, pp. 55–59). CEUR-WS.org. [bib]
  15. Gebser, M., Maratea, M., & Ricca, F. (2015). The Design of the Sixth Answer Set Programming Competition - - Report -. In LPNMR (Vol. 9345, pp. 531–544). Springer. [pdf] [bib]
  16. Gebser, M., Janhunen, T., Kaminski, R., Schaub, T., & Tasharrofi, S. (2015). Writing Declarative Specifications for Clauses. In GTTV@LPNMR. [pdf] [bib]
  17. 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]

2014

  1. Gebser, M., Janhunen, T., & Rintanen, J. (2014). Answer Set Programming as SAT modulo Acyclicity. In ECAI (Vol. 263, pp. 351–356). IOS Press. [pdf] [bib]
  2. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014). Clingo = ASP + Control: Extended Report. University of Potsdam. [pdf] [bib]
  3. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014). Clingo = ASP + Control: Preliminary Report. CoRR, abs/1405.3694. [bib]
  4. Gebser, M., Janhunen, T., Kaminski, R., Schaub, T., & Tasharrofi, S. (2014). Declarative Encodings of Acyclicity Properties. In ASPOCP@LPNMR. [pdf] [bib]
  5. Bomanson, J., Gebser, M., & Janhunen, T. (2014). Improving the Normalization of Weight Rules in Answer Set Programs. In JELIA (Vol. 8761, pp. 166–180). Springer. [pdf] [bib]
  6. Cerexhe, T. J., Gebser, M., & Thielscher, M. (2014). Online Agent Logic Programming with oClingo. In PRICAI (Vol. 8862, pp. 945–957). Springer. [pdf] [bib]
  7. Calimeri, F., Gebser, M., Maratea, M., & Ricca, F. (2014). The Design of the Fifth Answer Set Programming Competition. CoRR, abs/1405.3710. [bib]
  8. Gebser, M., Janhunen, T., & Rintanen, J. (2014). ASP Encodings of Acyclicity Properties. In KR. AAAI Press. [pdf] [bib]
  9. Gebser, M., Janhunen, T., & Rintanen, J. (2014). SAT Modulo Graphs: Acyclicity. In JELIA (Vol. 8761, pp. 137–151). Springer. [pdf] [bib]

2013

  1. Andres, B., Gebser, M., Schaub, T., Haubelt, C., Reimann, F., & Glaß, M. (2013). A Combined Mapping and Routing Algorithm for 3D NoCs Based on ASP. In MBMV (pp. 35–46). Institut für Angewandte Mikroelektronik und Datentechnik, Fakultät für Informatik und Elektrotechnik, Universität Rostock. [pdf] [bib]
  2. Gebser, M., Obermeier, P., & Schaub, T. (2013). A System for Interactive Query Answering with Answer Set Programming. CoRR, abs/1312.6143. [bib]
  3. Andres, B., Sauer, M., Gebser, M., Schubert, T., Becker, B., & Schaub, T. (2013). Accurate Computation of Sensitizable Paths Using Answer Set Programming. In LPNMR (Vol. 8148, pp. 92–101). Springer. [pdf] [bib]
  4. Gebser, M., Kaufmann, B., & Schaub, T. (2013). Advanced Conflict-Driven Disjunctive Answer Set Solving. In IJCAI (pp. 912–918). IJCAI/AAAI. [pdf] [bib]
  5. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2013). Answer Set Programming for Stream Reasoning. CoRR, abs/1301.1392. [bib]
  6. Banbara, M., Gebser, M., Inoue, K., Schaub, T., Soh, T., Tamura, N., & Weise, M. (2013). Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. CoRR, abs/1312.6113. [bib]
  7. Gebser, M., Kaufmann, B., Romero, J., Otero, R., Schaub, T., & Wanko, P. (2013). Domain-Specific Heuristics in Answer Set Programming. In AAAI. AAAI Press. [pdf] [bib]
  8. Collet, G., Eveillard, D., Gebser, M., Prigent, S., Schaub, T., Siegel, A., & Thiele, S. (2013). Extending the Metabolic Network of Ectocarpus Siliculosus Using Answer Set Programming. In LPNMR (Vol. 8148, pp. 245–256). Springer. [pdf] [bib]
  9. Gebser, M., Glase, T., Sabuncu, O., & Schaub, T. (2013). Matchmaking with Answer Set Programming. In LPNMR (Vol. 8148, pp. 342–347). Springer. [pdf] [bib]
  10. 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]
  11. Andres, B., Gebser, M., Schaub, T., Haubelt, C., Reimann, F., & Glaß, M. (2013). Symbolic System Synthesis Using Answer Set Programming. In LPNMR (Vol. 8148, pp. 79–91). Springer. [pdf] [bib]
  12. Gebser, M., & Schaub, T. (2013). Tableau Calculi for Logic Programs under Answer Set Semantics. ACM Trans. Comput. Log., 14(2), 15:1–15:40. [pdf] [bib]
  13. Gavanelli, M., & Gebser, M. (2013). The ICLP 2013 Doctoral Consortium. TPLP, 13(4-5-Online-Supplement). [bib]
  14. Gebser, M., Obermeier, P., & Schaub, T. (2013). A system for interactive query answering with answer set programming. In ASPOCP. [pdf] [bib]

2012

  1. Andres, B., Sauer, M., Gebser, M., Schubert, T., Becker, B., & Schaub, T. (2012). Accurate Computation of Longest Sensitizable Paths using Answer Set Programming. In ZuE. [pdf] [bib]
  2. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2012). Answer Set Programming for Stream Reasoning. In ASPOCP@LPNMR. [pdf] [bib]
  3. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2012). Answer Set Solving in Practice. Morgan & Claypool Publishers. [bib]
  4. Gebser, M., Kaufmann, B., & Schaub, T. (2012). Conflict-driven answer set solving: From theory to practice. Artif. Intell., 187, 52–89. [pdf] [bib]
  5. Gebser, M., Kaufmann, R., & Schaub, T. (2012). Gearing Up for Effective ASP Planning. In Correct Reasoning (Vol. 7265, pp. 296–310). Springer. [pdf] [bib]
  6. Gebser, M., Kaufmann, B., & Schaub, T. (2012). Multi-threaded ASP Solving with clasp. CoRR, abs/1210.3265. [bib]
  7. Gebser, M., Kaufmann, B., & Schaub, T. (2012). Multi-threaded ASP solving with clasp. TPLP, 12(4-5), 525–545. [pdf] [bib]
  8. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2012). Stream Reasoning with Answer Set Programming: Extended Version. Unpublished draft. [bib]
  9. 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]

2011

  1. 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]
  2. 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]
  3. Gebser, M., Sabuncu, O., & Schaub, T. (2011). An incremental answer set programming based system for finite model computation. AI Commun., 24(2), 195–212. [pdf] [bib]
  4. 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]
  5. 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]
  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., & Schaub, T. (2011). Complex Optimization in Answer Set Programming. CoRR, abs/1107.5742. [bib]
  8. Gebser, M., Kaminski, R., & Schaub, T. (2011). Complex optimization in answer set programming. TPLP, 11(4-5), 821–839. [pdf] [bib]
  9. Gebser, M., Kaminski, R., & Schaub, T. (2011). Complex optimization in answer set programming: Extended Version. [pdf] [bib]
  10. Gebser, M., Schaub, T., Thiele, S., & Veber, P. (2011). Detecting inconsistencies in large biological networks with answer set programming. TPLP, 11(2-3), 323–360. [pdf] [bib]
  11. Gebser, M., Sabuncu, O., & Schaub, T. (2011). Finite Model Computation via Answer Set Programming. In IJCAI (pp. 2626–2631). IJCAI/AAAI. [pdf] [bib]
  12. 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]
  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]
  14. Gebser, M., Lee, J., & Lierler, Y. (2011). On elementary loops of logic programs. TPLP, 11(6), 953–988. [bib]
  15. 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]
  16. 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]
  17. Gebser, M. (2011). Proof theory and algorithms for answer set programming (PhD thesis). University of Potsdam. [bib]
  18. Gebser, M., Grote, T., Kaminski, R., & Schaub, T. (2011). Reactive Answer Set Programming. In LPNMR (Vol. 6645, pp. 54–66). Springer. [pdf] [bib]

2010

  1. Gebser, M., Sabuncu, O., & Schaub, T. (2010). An Incremental Answer Set Programming Based System for Finite ModelComputation. In JELIA (Vol. 6341, pp. 169–181). Springer. [pdf] [bib]
  2. Gebser, M., Grote, T., & Schaub, T. (2010). Coala: A Compiler from Action Languages to ASP. In JELIA (Vol. 6341, pp. 360–364). Springer. [pdf] [bib]
  3. Gebser, M., Schaub, T., Thiele, S., & Veber, P. (2010). Detecting Inconsistencies in Large Biological Networks with Answer Set Programming. CoRR, abs/1007.0134. [bib]
  4. Drescher, C., Gebser, M., Kaufmann, B., & Schaub, T. (2010). Heuristics in Conflict Resolution. CoRR, abs/1005.1716. [bib]
  5. Gebser, M., Lee, J., & Lierler, Y. (2010). On Elementary Loops of Logic Programs. CoRR, abs/1012.5847. [bib]
  6. Gebser, M., Guziolowski, C., Ivanchev, M., Schaub, T., Siegel, A., Thiele, S., & Veber, P. (2010). Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming. In KR. AAAI Press. [pdf] [bib]
  7. Gebser, M., König, A., Schaub, T., Thiele, S., & Veber, P. (2010). The BioASP Library: ASP Solutions for Systems Biology. In ICTAI (1) (pp. 383–389). IEEE Computer Society. [pdf] [bib]

2009

  1. 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]
  2. Ishebabi, H., Mahr, P., Bobda, C., Gebser, M., & Schaub, T. (2009). Answer Set versus Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems from Real-Time Parallel Programs. Int. J. Reconfig. Comp., 2009, 863630:1–863630:11. [bib]
  3. Ishebabi, H., Mahr, P., Bobda, C., Gebser, M., & Schaub, T. (2009). Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs. In LPNMR (Vol. 5753, pp. 598–603). Springer. [pdf] [bib]
  4. Gebser, M., Ostrowski, M., & Schaub, T. (2009). Constraint Answer Set Solving. In ICLP (Vol. 5649, pp. 235–249). Springer. [pdf] [bib]
  5. 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]
  6. Gebser, M., Gharib, M., Mercer, R. E., & Schaub, T. (2009). Monotonic Answer Set Programming. J. Log. Comput., 19(4), 539–564. [bib]
  7. 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]
  8. 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]
  9. Gebser, M., Kaufmann, B., & Schaub, T. (2009). Solution Enumeration for Projected Boolean Search Problems. In CPAIOR (Vol. 5547, pp. 71–86). Springer. [pdf] [bib]
  10. Gebser, M., Kaufmann, B., & Schaub, T. (2009). The Conflict-Driven Answer Set Solver clasp: Progress Report. In LPNMR (Vol. 5753, pp. 509–514). Springer. [pdf] [bib]
  11. Denecker, M., Vennekens, J., Bond, S., Gebser, M., & Truszczynski, M. (2009). The Second Answer Set Programming Competition. In LPNMR (Vol. 5753, pp. 637–654). Springer. [pdf] [bib]
  12. Gebser, M., Hinrichs, H., Schaub, T., & Thiele, S. (2009). xpanda: A (Simple) Preprocessor for Adding Multi-Valued Propositions to ASP. In WLP. [pdf] [bib]

2008

  1. Gebser, M., Pührer, J., Schaub, T., & Tompits, H. (2008). A Meta-Programming Technique for Debugging Answer-Set Programs. In AAAI (pp. 448–453). AAAI Press. [pdf] [bib]
  2. Gebser, M., Janhunen, T., Ostrowski, M., Schaub, T., & Thiele, S. (2008). A Versatile Intermediate Language for Answer Set Programming. In NMR@KR (pp. 150–159). [pdf] [bib]
  3. Gebser, M., Janhunen, T., Ostrowski, M., Schaub, T., & Thiele, S. (2008). A Versatile Intermediate Language for Answer Set Programming: Syntax Proposal. Unpublished draft. [pdf] [bib]
  4. Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. (2008). Advanced Preprocessing for Answer Set Solving. In ECAI (Vol. 178, pp. 15–19). IOS Press. [pdf] [bib]
  5. Gebser, M., Schaub, T., Tompits, H., & Woltran, S. (2008). Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. In FoIKS (Vol. 4932, pp. 24–41). Springer. [pdf] [bib]
  6. Drescher, C., Gebser, M., Grote, T., Kaufmann, B., König, A., Ostrowski, M., & Schaub, T. (2008). Conflict-Driven Disjunctive Answer Set Solving. In KR (pp. 422–432). AAAI Press. [pdf] [bib]
  7. Gebser, M., Schaub, T., Thiele, S., Usadel, B., & Veber, P. (2008). Detecting Inconsistencies in Large Biological Networks with Answer Set Programming. In ICLP (Vol. 5366, pp. 130–144). Springer. [pdf] [bib]
  8. 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]
  9. Drescher, C., Gebser, M., Kaufmann, B., & Schaub, T. (2008). Heuristics in Conflict Resolution. In NMR@KR (pp. 141–149). [pdf] [bib]

2007

  1. Gebser, M. (2007). Advanced Techniques for Answer Set Programming. In ICLP (Vol. 4670, pp. 458–459). Springer. [bib]
  2. Gebser, M., Schaub, T., Tompits, H., & Woltran, S. (2007). Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. In CENT (Vol. 265). CEUR-WS.org. [pdf] [bib]
  3. Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. (2007). clasp: A Conflict-Driven Answer Set Solver. In LPNMR (Vol. 4483, pp. 260–265). Springer. [pdf] [bib]
  4. Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. (2007). Conflict-Driven Answer Set Enumeration. In LPNMR (Vol. 4483, pp. 136–148). Springer. [pdf] [bib]
  5. Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. (2007). Conflict-Driven Answer Set Solving. In IJCAI (p. 386). [pdf] [bib]
  6. Brain, M., Gebser, M., Pührer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). Debugging ASP Programs by Means of ASP. In LPNMR (Vol. 4483, pp. 31–43). Springer. [pdf] [bib]
  7. Gebser, M., & Schaub, T. (2007). Generic Tableaux for Answer Set Programming. In ICLP (Vol. 4670, pp. 119–133). Springer. [pdf] [bib]
  8. Gebser, M., Schaub, T., & Thiele, S. (2007). GrinGo : A New Grounder for Answer Set Programming. In LPNMR (Vol. 4483, pp. 266–271). Springer. [pdf] [bib]
  9. Gebser, M., Lee, J., & Lierler, Y. (2007). Head-Elementary-Set-Free Logic Programs. In LPNMR (Vol. 4483, pp. 149–161). Springer. [pdf] [bib]
  10. Gebser, M., Gharib, M., & Schaub, T. (2007). Incremental Answer Sets and Their Computation. In ASP (pp. 161–174). [pdf] [bib]
  11. Gebser, M., Pührer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. In INAP/WLP (Vol. 5437, pp. 247–252). Springer. [bib]
  12. Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., & Truszczynski, M. (2007). The First Answer Set Programming System Competition. In LPNMR (Vol. 4483, pp. 3–17). Springer. [pdf] [bib]
  13. Brain, M., Gebser, M., Pührer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). "That is Illogical Captain!" – The Debugging Support Tool spock for Answer-Set Programs: System Description. In SEA (pp. 71–85). [pdf] [bib]

2006

  1. Anger, C., Gebser, M., & Schaub, T. (2006). Approaching the Core of Unfounded Set. In NMR (pp. 58–66). [pdf] [bib]
  2. Gebser, M., Lee, J., & Lierler, Y. (2006). Elementary Sets of Logic Programs. In AAAI (pp. 244–249). AAAI Press. [pdf] [bib]
  3. Gebser, M., & Schaub, T. (2006). Tableau Calculi for Answer Set Programming. In ICLP (Vol. 4079, pp. 11–25). Springer. [pdf] [bib]
  4. Anger, C., Gebser, M., Janhunen, T., & Schaub, T. (2006). What’s a Head Without a Body? In ECAI (Vol. 141, pp. 769–770). IOS Press. [pdf] [bib]

2005

  1. Gebser, M., & Schaub, T. (2005). Loops: Relevant or Redundant? In LPNMR (Vol. 3662, pp. 53–65). Springer. [pdf] [bib]
  2. Anger, C., Gebser, M., Linke, T., Neumann, A., & Schaub, T. (2005). The nomore++ Approach to Answer Set Solving. In Answer Set Programming (Vol. 142). CEUR-WS.org. [bib]
  3. Anger, C., Gebser, M., Linke, T., Neumann, A., & Schaub, T. (2005). The nomore++ Approach to Answer Set Solving. In LPAR (Vol. 3835, pp. 95–109). Springer. [pdf] [bib]
  4. Anger, C., Gebser, M., Linke, T., Neumann, A., & Schaub, T. (2005). The nomore++ System. In LPNMR (Vol. 3662, pp. 422–426). Springer. [pdf] [bib]