Lifschitz, V., Lühne, P., & Schaub, T. (2020). Towards Verifying Logic Programs in the Input Language of clingo. In Fields of Logic and Computation III (Vol. 12180, pp. 190–209). Springer.[pdf][bib]
Fandinno, J., Lifschitz, V., Lühne, P., & Schaub, T. (2020). Verifying Tight Logic Programs with anthem and Vampire. CoRR, abs/2008.02025.[pdf][bib]
Fandinno, J., Lifschitz, V., Lühne, P., & Schaub, T. (2020). Verifying Tight Logic Programs with anthem and vampire. Theory Pract. Log. Program., 20(5), 735–750.[pdf][bib]
2019
Lifschitz, V., Lühne, P., & Schaub, T. (2019). Verifying Strong Equivalence of Programs in the Input Language of gringo. In LPNMR (Vol. 11481, pp. 270–283). Springer.[pdf][bib]
Lühne, P. (2019). Discovering and Proving Invariants in Answer Set Programming and Planning. CoRR, abs/1905.03196.[bib]
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]
2018
Lifschitz, V., Lühne, P., & Schaub, T. (2018). anthem: Transforming gringo Programs into First-Order Theories (Preliminary Report). CoRR, abs/1810.00453.[pdf][bib]
Dimopoulos, Y., Gebser, M., Lühne, P., Romero, J., & Schaub, T. (2018). plasp 3: Towards Effective ASP Planning. CoRR, abs/1812.04491.[pdf][bib]
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
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]
Lühne, P. (2017). Discovering and Proving Invariants in Answer Set Programming and Planning. In DC@LPNMR (pp. 17–21).[pdf][bib]
2016
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]