Knowledge Processing and Information Systems
Publications

2026

  1. Otten, J., & Schaub, T. (2026). Implementing the First-Order Logic of Here and There. CoRR, abs/2601.03848. [bib]

2025

  1. Takada, K., Banbara, M., Ito, T., Kawahara, J., Minato, S.-ichi, Schaub, T., & Uehara, R. (2025). Multi-Objective Combinatorial Reconfiguration Considering Cost and Length by Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. ECAI, 413, 1575–1582. [bib]
  2. Ortiz, M., Wassermann, R., & Schaub, T. (Eds.). (2025). Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning, KR 2025, Melbourne, Australia, November 1-17, 2025. [bib]
  3. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2025). Strong Equivalence in Answer Set Programming with Constraints. CoRR, abs/2502.04302. [pdf] [bib]
  4. 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]
  5. Becker, A., Cabalar, P., Diéguez Martı́n, Romero, J., Hahn, S., & Schaub, T. (2025). Compiling Metric Temporal Answer Set Programming. CoRR, abs/2506.08150. [pdf] [bib]
  6. Nabeshima, H., Banbara, M., Schaub, T., & Soh, T. (2025). The ASP-based Nurse Scheduling System at the University of Yamanashi Hospital. CoRR, abs/2506.13600. [pdf] [bib]
  7. Fandinno, J., Glinzer, C., Hansen, Z., Heuer, J., Lierler, Y., Lifschitz, V., Schaub, T., & Stolzmann, T. (2025). Anthem 2.0: Automated Reasoning for Answer Set Programming. CoRR, abs/2507.11704. [bib]
  8. Cabalar, P., Diéguez Martı́n, Olivier, F., Schaub, T., & Stéphan, I. (2025). Towards Constraint Temporal Answer Set Programming. CoRR, abs/2507.13958. [bib]
  9. Balázová, L., Comploi-Taupe, R., Hahn, S., Rühling, N., & Schenner, G. (2025). Smart Expansion Techniques for ASP-based Interactive Configuration. CoRR, abs/2507.21027. [bib]
  10. Balázová, L., Comploi-Taupe, R., Hahn, S., Rühling, N., & Schenner, G. (2025). Smart Expansion Techniques for ASP-Based Interactive Configuration. Theory Pract. Log. Program., 25(4), 473–488. [bib]
  11. Cabalar, P., Diéguez Martı́n, Olivier, F., Schaub, T., & Stéphan, I. (2025). Towards Constraint Temporal Answer Set Programming. Theory Pract. Log. Program., 25(4), 579–594. [bib]
  12. Fandinno, J., Hansen, Z., Lierler, Y., Glinzer, C., Heuer, J., Schaub, T., Stolzmann, T., & Lifschitz, V. (2025). ANTHEM 2.0: Automated Reasoning for Answer Set Programming. Theory Pract. Log. Program., 25(4), 668–684. [bib]
  13. Hahn, S., Janhunen, T., Kaminski, R., Romero, J., Rühling, N., & Schaub, T. (2025). Plingo: A System for Probabilistic Reasoning in Answer Set Programming. Theory Pract. Log. Program., 25(2), 134–167. [bib]
  14. Romero, J., Schaub, T., & Strauch, K. (2025). On the Generalization of Learned Constraints for ASP Solving in Temporal Domains. Theory Pract. Log. Program., 25(2), 197–224. [bib]
  15. Dávila, J. R. (2025). A general framework for preferences in answer set programming [PhD thesis]. University of Potsdam, Germany. [bib]
  16. 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. Kaminski, R., Schaub, T., Strauch, K., & Svancara Jirı́. (2024). Improving the Sum-of-Cost Methods for Reduction-Based Multi-Agent Pathfinding Solvers. ICAART (1), 264–271. [pdf] [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. ICAART (3), 23–33. [pdf] [bib]
  3. Sugimori, I., Inoue, K., Nabeshima, H., Schaub, T., Soh, T., Tamura, N., & Banbara, M. (2024). Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. KR. [pdf] [bib]
  4. Alviano, M., Hahn, S., Sabuncu, O., & Weichelt, H. (2024). Answer Set Explanations via Preferred Unit-Provable Unsatisfiable Subsets. LPNMR, 15245, 187–199. [bib]
  5. 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]
  6. Becker, A., Cabalar, P., Diéguez Martı́n, Hahn, S., Romero, J., & Schaub, T. (2024). Compiling Metric Temporal Answer Set Programming. LPNMR, 15245, 15–29. [pdf] [bib]
  7. Cabalar, P., Diéguez Martı́n, Laferrière, F., Schaub, T., & Stéphan, I. (2024). A Fixpoint Characterisation of Temporal Equilibrium Logic. LPNMR, 15245, 304–316. [bib]
  8. Sugimori, I., Inoue, K., Nabeshima, H., Schaub, T., Soh, T., Tamura, N., & Banbara, M. (2024). ASP-Based Large Neighborhood Prioritized Search for Course Timetabling. LPNMR, 15245, 57–70. [bib]
  9. Yamada, Y., Banbara, M., Inoue, K., Schaub, T., & Uehara, R. (2024). Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. WALCOM, 14549, 242–256. [bib]
  10. Becker, A., Cabalar, P., Diéguez Martı́n, Cerro, L. F. del, Schaub, T., & Schuhmann, A. (2024). Metric Dynamic Equilibrium Logic. CoRR, abs/2401.10781. [pdf] [bib]
  11. Romero, J., Schaub, T., & Strauch, K. (2024). On the generalization of learned constraints for ASP solving in temporal domains. CoRR, abs/2401.16124. [pdf] [bib]
  12. 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]
  13. Sugimori, I., Inoue, K., Nabeshima, H., Schaub, T., Soh, T., Tamura, N., & Banbara, M. (2024). Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming. CoRR, abs/2405.11305. [pdf] [bib]
  14. 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]
  15. Kato, M., Schaub, T., Soh, T., Tamura, N., & Banbara, M. (2024). Dominating Set Reconfiguration with Answer Set Programming. CoRR, abs/2408.07510. [pdf] [bib]
  16. Beiser, A., Hahn, S., & Schaub, T. (2024). ASP-driven User-interaction with Clinguin. ICLP, 416, 215–228. [pdf] [bib]
  17. Hahn, S. (2024). Computational methods for Dynamic Answer Set Programming. ICLP, 416, 324–331. [pdf] [bib]
  18. 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]
  19. Becker, A., Cabalar, P., Diéguez Martı́n, Schaub, T., & Schuhmann, A. (2024). Metric Temporal Equilibrium Logic over Timed Traces. Theory Pract. Log. Program., 24(3), 425–452. [bib]
  20. 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]
  21. Hahn, S., Sabuncu, O., Schaub, T., & Stolzmann, T. (2024). Clingraph: A System for ASP-based Visualization. Theory Pract. Log. Program., 24(3), 533–559. [pdf] [bib]
  22. Kato, M., Banbara, M., Schaub, T., Soh, T., & Tamura, N. (2024). Dominating Set Reconfiguration with Answer Set Programming. Theory Pract. Log. Program., 24(4), 755–771. [pdf] [bib]

2023

  1. Fandinno, J., Mishra, S., Romero, J., & Schaub, T. (2023). Answer Set Programming Made Easy. Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems, 13160, 133–150. [pdf] [bib]
  2. Comploi-Taupe, R., Falkner, A. A., Hahn, S., Schaub, T., & Schenner, G. (2023). Interactive Configuration with ASP Multi-Shot Solving. ConfWS, 3509, 95–103. [pdf] [bib]
  3. Rühling, N., Schaub, T., & Stolzmann, T. (2023). Towards a formalization of configuration problems for ASP-based reasoning: Preliminary report. ConfWS, 3509, 85–94. [pdf] [bib]
  4. Svancara Jirı́, Obermeier, P., Husár, M., Barták, R., & Schaub, T. (2023). Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? ICAART (1), 199–206. [bib]
  5. 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]
  6. Cabalar, P., Diéguez Martı́n, Laferrière, F., & Schaub, T. (2023). Past-present temporal programs over finite traces: a preliminary report. ICLP Workshops, 3437. [pdf] [bib]
  7. 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]
  8. Cabalar, P., Diéguez Martı́n, Laferrière, F., & Schaub, T. (2023). Past-Present Temporal Programs over Finite Traces. JELIA, 14281, 787–795. [pdf] [bib]
  9. Hirate, T., Banbara, M., Inoue, K., Lu, X.-N., Nabeshima, H., Schaub, T., Soh, T., & Tamura, N. (2023). Hamiltonian Cycle Reconfiguration with Answer Set Programming. JELIA, 14281, 262–277. [bib]
  10. Yamada, Y., Banbara, M., Inoue, K., & Schaub, T. (2023). Recongo: Bounded Combinatorial Reconfiguration with Answer Set Programming. JELIA, 14281, 278–286. [bib]
  11. Takeuchi, R., Banbara, M., Tamura, N., & Schaub, T. (2023). Solving Vehicle Equipment Specification Problems with Answer Set Programming. PADL, 13880, 232–249. [bib]
  12. 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]
  13. Brewka, G., Delgrande, J. P., Romero, J., & Schaub, T. (2023). A general framework for preferences in answer set programming. Artif. Intell., 325, 104023. [pdf] [bib]
  14. 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]
  15. 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]
  16. 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]
  17. Hahn, S., Sabuncu, O., Schaub, T., & Stolzmann, T. (2023). Clingraph: A System for ASP-based Visualization. CoRR, abs/2303.10118. [pdf] [bib]
  18. Becker, A., Cabalar, P., Diéguez Martı́n, Schaub, T., & Schuhmann, A. (2023). Metric Temporal Equilibrium Logic over Timed Traces. CoRR, abs/2304.14778. [pdf] [bib]
  19. Yamada, Y., Banbara, M., Inoue, K., & Schaub, T. (2023). Bounded Combinatorial Reconfiguration with Answer Set Programming. CoRR, abs/2307.10688. [bib]
  20. Cabalar, P., Diéguez Martı́n, Laferrière, F., & Schaub, T. (2023). Past-present temporal programs over finite traces. CoRR, abs/2307.12620. [pdf] [bib]
  21. Becker, A., Cabalar, P., Diéguez Martı́n, Cerro, L. F. del, Schaub, T., & Schuhmann, A. (2023). Metric dynamic equilibrium logic. J. Appl. Non Class. Logics, 33(3-4), 495–519. [pdf] [bib]
  22. Aguado, F., Cabalar, P., Diéguez Martı́n, Pérez, G., Schaub, T., Schuhmann, A., & Vidal, C. (2023). Linear-Time Temporal Answer Set Programming. Theory Pract. Log. Program., 23(1), 2–56. [pdf] [bib]
  23. 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]
  24. Kaminski, R., & Schaub, T. (2023). On the Foundations of Grounding in Answer Set Programming. Theory Pract. Log. Program., 23(6), 1138–1197. [pdf] [bib]
  25. Son, T. C., Pontelli, E., Balduccini, M., & Schaub, T. (2023). Answer Set Planning: A Survey. Theory Pract. Log. Program., 23(1), 226–298. [bib]
  26. Kaminski, R. (2023). Complex reasoning with answer set programming (p. 301) [Doctoralthesis]. University of Potsdam. [pdf] [bib]

2022

  1. Husár, M., Svancara Jirı́, Obermeier, P., Barták, R., & Schaub, T. (2022). Reduction-based Solving of Multi-agent Pathfinding on Large Maps Using Graph Pruning. AAMAS, 624–632. [pdf] [bib]
  2. Herud, K., Baumeister, J., Sabuncu, O., & Schaub, T. (2022). Conflict Handling in Product Configuration using Answer Set Programming. ICLP Workshops, 3193. [bib]
  3. Cabalar, P., Diéguez Martı́n, Schaub, T., & Schuhmann, A. (2022). Metric Temporal Answer Set Programming over Timed Traces. LPNMR, 13416, 117–130. [bib]
  4. Hahn, S., Sabuncu, O., Schaub, T., & Stolzmann, T. (2022). Clingraph: ASP-Based Visualization. LPNMR, 13416, 401–414. [pdf] [bib]
  5. Romero, J., Schaub, T., & Strauch, K. (2022). On the Generalization of Learned Constraints for ASP Solving in Temporal Domains. RuleML+RR, 13752, 20–37. [bib]
  6. 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. RuleML+RR, 13752, 54–62. [pdf] [bib]
  7. Jung, J. C., Mayer-Eichberger, V., & Saffidine, A. (2022). QBF Programming with the Modeling Language Bule. SAT, 236, 31:1–31:14. [bib]
  8. Svancara Jirı́, Obermeier, P., Husár, M., Barták, R., & Schaub, T. (2022). Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? (Extended Abstract). SOCS, 320–322. [bib]
  9. Hecher, M. (2022). Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? Artif. Intell., 304, 103651. [bib]
  10. Son, T. C., Pontelli, E., Balduccini, M., & Schaub, T. (2022). Answer Set Planning: A Survey. CoRR, abs/2202.05793. [pdf] [bib]
  11. 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]
  12. Fichte, J. K., Hecher, M., & Schindler, I. (2022). Default logic and bounded treewidth. Inf. Comput., 283, 104675. [bib]

2021

  1. Fichte, J. K., Hecher, M., & Meier, A. (2021). Knowledge-Base Degrees of Inconsistency: Complexity and Counting. AAAI, 6349–6357. [bib]
  2. Fichte, J. K., Hecher, M., McCreesh, C., & Shahab, A. (2021). Complications for Computational Experiments from Modern Processors. CP, 210, 25:1–25:21. [bib]
  3. Fichte, J. K., Hecher, M., & Roland, V. (2021). Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. CP, 210, 24:1–24:20. [bib]
  4. Cabalar, P., Diéguez Martı́n, Hahn, S., & Schaub, T. (2021). Automata for Dynamic Answer Set Solving: Preliminary Report. ICLP Workshops, 2970. [pdf] [bib]
  5. Eiter, T., Hecher, M., & Kiesel, R. (2021). aspmc: An Algebraic Answer Set Counter. ICLP Workshops, 2970. [bib]
  6. Fichte, J. K., Hecher, M., Mahmood, Y., & Meier, A. (2021). Decomposition-Guided Reductions for Argumentation and Treewidth. IJCAI, 1880–1886. [bib]
  7. Eiter, T., Hecher, M., & Kiesel, R. (2021). Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. KR, 269–279. [bib]
  8. Rodriguez, I. D., Bonet, B., Romero, J., & Geffner, H. (2021). Learning First-Order Representations for Planning from Black Box States: New Results. KR, 539–548. [pdf] [bib]
  9. Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2021). DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Algorithms, 14(3), 81. [bib]
  10. Rodriguez, I. D., Bonet, B., Romero, J., & Geffner, H. (2021). Learning First-Order Representations for Planning from Black-Box States: New Results. CoRR, abs/2105.10830. [pdf] [bib]
  11. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2021). Towards a Semantics for Hybrid ASP systems. CoRR, abs/2108.03061. [pdf] [bib]
  12. Kaminski, R., & Schaub, T. (2021). On the Foundations of Grounding in Answer Set Programming. CoRR, abs/2108.04769. [pdf] [bib]
  13. Fandinno, J., Laferrière, F., Romero, J., Schaub, T., & Son, T. C. (2021). Planning with Incomplete Information in Quantified Answer Set Programming. CoRR, abs/2108.06405. [pdf] [bib]
  14. Cabalar, P., Diéguez Martı́n, Hahn, S., & Schaub, T. (2021). Automata for dynamic answer set solving: Preliminary report. CoRR, abs/2109.01782. [pdf] [bib]
  15. Hahn, S. (2021). Automata Techniques for Temporal Answer Set Programming. ICLP Technical Communications, 345, 258–266. [pdf] [bib]
  16. Mishra, S. (2021). Product Configuration in Answer Set Programming. ICLP Technical Communications, 345, 296–304. [bib]
  17. Tignon, E. (2021). Formalisation of Action with Durations in Answer Set Programming. ICLP Technical Communications, 345, 305–309. [bib]
  18. Fandinno, J., Mishra, S., Romero, J., & Schaub, T. (2021). Answer Set Programming Made Easy. CoRR, abs/2111.06366. [pdf] [bib]
  19. 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]
  20. Fandinno, J., Laferrière, F., Romero, J., Schaub, T., & Son, T. C. (2021). Planning with Incomplete Information in Quantified Answer Set Programming. Theory Pract. Log. Program., 21(5), 663–679. [pdf] [bib]
  21. Mishra, S. (2021). Product Configuration in Answer Set Programming. CoRR, abs/2109.08304. [pdf] [bib]
  22. Cabalar, P., Diéguez Martı́n, Schaub, T., & Schuhmann, A. (2021). Metric Temporal Answer Set Programming over Timed Traces (extended abstract). Stream Reasoning Workshop. [pdf] [bib]

2020

  1. Hecher, M., Morak, M., & Woltran, S. (2020). Structural Decompositions of Epistemic Logic Programs. AAAI, 2830–2837. [bib]
  2. Lifschitz, V., Lühne, P., & Schaub, T. (2020). Towards Verifying Logic Programs in the Input Language of clingo. Fields of Logic and Computation III, 12180, 190–209. [pdf] [bib]
  3. Fichte, J. K., Hecher, M., & Kieler, M. F. I. (2020). Treewidth-Aware Quantifier Elimination and Expansion for QCSP. CP, 12333, 248–266. [bib]
  4. Fichte, J. K., Hecher, M., & Szeider, S. (2020). A Time Leap Challenge for SAT-Solving. CP, 12333, 267–285. [bib]
  5. Fichte, J. K., Hecher, M., & Szeider, S. (2020). Breaking Symmetries with RootClique and LexTopSort. CP, 12333, 286–303. [bib]
  6. Aguado, F., Cabalar, P., Fandinno, J., Pérez, G., & Vidal, C. (2020). Explicit Negation in Linear-Dynamic Equilibrium Logic. ECAI, 325, 569–576. [pdf] [bib]
  7. Cabalar, P., Diéguez Martı́n, Schaub, T., & Laferrière, F. (2020). Implementing Dynamic Answer Set Programming over Finite Traces. ECAI, 325, 656–663. [pdf] [bib]
  8. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). An ASP Semantics for Constraints Involving Conditional Aggregates. ECAI, 325, 664–671. [pdf] [bib]
  9. Dodaro, C., Elder, G. A., Faber, W., Fandinno, J., Gebser, M., Hecher, M., LeBlanc, E., Morak, M., & Zangari, J. (Eds.). (2020). International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy, September 18-19, 2020 (Vol. 2678). CEUR-WS.org. [bib]
  10. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2020). Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning. ICLP Workshops, 2678. [pdf] [bib]
  11. Hecher, M., Morak, M., & Woltran, S. (2020). Structural Decompositions of Epistemic Logic Programs. ICLP Workshops, 2678. [bib]
  12. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2020). Forgetting Auxiliary Atoms in Forks (Extended Abstract). IJCAI, 5005–5009. [bib]
  13. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2020). On the Splitting Property for Epistemic Logic Programs (Extended Abstract). IJCAI, 4721–4725. [bib]
  14. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. KR, 193–202. [pdf] [bib]
  15. Hecher, M. (2020). Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? KR, 485–495. [bib]
  16. Fichte, J. K., Hecher, M., & Pfandler, A. (2020). Lower Bounds for QBFs of Bounded Treewidth. LICS, 410–424. [bib]
  17. Fichte, J. K., Hecher, M., Thier, P., & Woltran, S. (2020). Exploiting Database Management Systems and Treewidth for Counting. PADL, 12007, 151–167. [bib]
  18. Hecher, M., Thier, P., & Woltran, S. (2020). Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. SAT, 12178, 343–360. [bib]
  19. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2020). Autoepistemic answer set programming. Artif. Intell., 289, 103382. [pdf] [bib]
  20. Fichte, J. K., Hecher, M., Thier, P., & Woltran, S. (2020). Exploiting Database Management Systems and Treewidth for Counting. CoRR, abs/2001.04191. [bib]
  21. Hecher, M., Morak, M., & Woltran, S. (2020). Structural Decompositions of Epistemic Logic Programs. CoRR, abs/2001.04219. [bib]
  22. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). An ASP semantics for Constraints involving Conditional Aggregates. CoRR, abs/2002.06911. [pdf] [bib]
  23. Cabalar, P., Diéguez Martı́n, Schaub, T., & Laferrière, F. (2020). Implementing Dynamic Answer Set Programming. CoRR, abs/2002.06916. [pdf] [bib]
  24. 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]
  25. 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]
  26. Hecher, M., & Fandinno, J. (2020). Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. CoRR, abs/2007.04620. [bib]
  27. Cabalar, P., Fandinno, J., & Lierler, Y. (2020). Modular Answer Set Programming as a Formal Specification Language. CoRR, abs/2008.02015. [bib]
  28. Cabalar, P., Fandinno, J., Garea, J., Romero, J., & Schaub, T. (2020). eclingo: A solver for Epistemic Logic Programs. CoRR, abs/2008.02018. [pdf] [bib]
  29. Fandinno, J., Lifschitz, V., Lühne, P., & Schaub, T. (2020). Verifying Tight Logic Programs with anthem and Vampire. CoRR, abs/2008.02025. [pdf] [bib]
  30. Cabalar, P., Diéguez Martı́n, Schaub, T., & Schuhmann, A. (2020). Towards Metric Temporal Answer Set Programming. CoRR, abs/2008.02038. [pdf] [bib]
  31. Fichte, J. K., Hecher, M., & Szeider, S. (2020). A Time Leap Challenge for SAT Solving. CoRR, abs/2008.02215. [bib]
  32. Kaminski, R., Romero, J., Schaub, T., & Wanko, P. (2020). How to build your own ASP-based system?! CoRR, abs/2008.06692. [pdf] [bib]
  33. Aguado, F., Cabalar, P., Diéguez Martı́n, Pérez, G., Schaub, T., Schuhmann, A., & Vidal, C. (2020). Temporal Answer Set Programming. CoRR, abs/2009.06544. [pdf] [bib]
  34. Cabalar, P., Fandinno, J., & Muñiz, B. (2020). A System for Explainable Answer Set Programming. ICLP Technical Communications, 325, 124–136. [pdf] [bib]
  35. Fichte, J. K., Hecher, M., & Schidler, A. (2020). Solving the Steiner Tree Problem with few Terminals. CoRR, abs/2011.04593. [bib]
  36. Gebser, M., Janhunen, T., & Rintanen, J. (2020). Declarative encodings of acyclicity properties. J. Log. Comput., 30(4), 923–952. [bib]
  37. Cabalar, P., Diéguez Martı́n, Schaub, T., & Schuhmann, A. (2020). Towards Metric Temporal Answer Set Programming. Theory Pract. Log. Program., 20(5), 783–798. [pdf] [bib]
  38. Cabalar, P., Fandinno, J., Garea, J., Romero, J., & Schaub, T. (2020). eclingo : A Solver for Epistemic Logic Programs. Theory Pract. Log. Program., 20(6), 834–847. [pdf] [bib]
  39. Cabalar, P., Fandinno, J., & Lierler, Y. (2020). Modular Answer Set Programming as a Formal Specification Language. Theory Pract. Log. Program., 20(5), 767–782. [pdf] [bib]
  40. Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Maratea, M., Ricca, F., & Schaub, T. (2020). ASP-Core-2 Input Language Format. Theory Pract. Log. Program., 20(2), 294–309. [pdf] [bib]
  41. 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]
  42. Gebser, M., Maratea, M., & Ricca, F. (2020). The Seventh Answer Set Programming Competition: Design and Results. Theory Pract. Log. Program., 20(2), 176–204. [pdf] [bib]
  43. Fandinno, J., Mishra, S., Romero, J., & Schaub, T. (2020). Answer Set Programming Made Easy. ASPOCP@ICLP. [pdf] [bib]

2019

  1. Fichte, J. K., Hecher, M., & Meier, A. (2019). Counting Complexity for Reasoning in Abstract Argumentation. AAAI, 2827–2834. [bib]
  2. Cabalar, P., & Schaub, T. (2019). Temporal Logic Programs with Temporal Description Logic Axioms. Description Logic, Theory Combination, and All That, 11560, 174–186. [pdf] [bib]
  3. Fichte, J. K., Hecher, M., & Zisser, M. (2019). An Improved GPU-Based SAT Model Counter. CP, 11802, 491–509. [bib]
  4. Cabalar, P., & Schaub, T. (2019). Dynamic and Temporal Answer Set Programming on Linear Finite Traces. Datalog, 2368, 3–6. [pdf] [bib]
  5. Alviano, M., Romero, J., & Schaub, T. (2019). On the Integration of CP-nets in ASPRIN. IJCAI, 1495–1501. [pdf] [bib]
  6. Dzulfikar, M. A., Fichte, J. K., & Hecher, M. (2019). The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper). IPEC, 148, 25:1–25:23. [bib]
  7. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2019). Lower Bound Founded Logic of Here-and-There. JELIA, 11468, 509–525. [pdf] [bib]
  8. Everardo, F., & Osorio, M. (2019). Towards an answer set programming methodology for constructing programs following a semi-automatic approach. LANMR, 2585, 61–72. [pdf] [bib]
  9. Everardo, F., & Osorio, M. (2019). Towards an Answer Set Programming Methodology for Constructing Programs Following a Semi-Automatic Approach - Extended and Revised version. LANMR (Selected Papers), 354, 29–44. [bib]
  10. Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., & Wanko, P. (2019). Train Scheduling with Hybrid ASP. LPNMR, 11481, 3–17. [pdf] [bib]
  11. Cabalar, P., Diéguez Martı́n, & Schaub, T. (2019). Towards Dynamic Answer Set Programming over Finite Traces. LPNMR, 11481, 148–162. [pdf] [bib]
  12. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2019). Splitting Epistemic Logic Programs. LPNMR, 11481, 120–133. [pdf] [bib]
  13. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2019). Founded World Views with Autoepistemic Equilibrium Logic. LPNMR, 11481, 134–147. [pdf] [bib]
  14. Cabalar, P., Kaminski, R., Morkisch, P., & Schaub, T. (2019). telingo = ASP + Time. LPNMR, 11481, 256–269. [pdf] [bib]
  15. Everardo, F., Janhunen, T., Kaminski, R., & Schaub, T. (2019). The Return of xorro. LPNMR, 11481, 284–297. [pdf] [bib]
  16. Fichte, J. K., & Hecher, M. (2019). Treewidth and Counting Projected Answer Sets. LPNMR, 11481, 105–119. [bib]
  17. Lifschitz, V., Lühne, P., & Schaub, T. (2019). Verifying Strong Equivalence of Programs in the Input Language of gringo. LPNMR, 11481, 270–283. [pdf] [bib]
  18. Nguyen, V., Obermeier, P., Son, T. C., Schaub, T., & Yeoh, W. (2019). Generalized Target Assignment and Path Finding Using Answer Set Programming. SOCS, 194–195. [bib]
  19. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2019). Forgetting auxiliary atoms in forks. Artif. Intell., 275, 575–601. [pdf] [bib]
  20. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2019). Gelfond-Zhang aggregates as propositional formulas. Artif. Intell., 274, 26–43. [pdf] [bib]
  21. 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]
  22. Dvorák, W., Fandinno, J., & Woltran, S. (2019). On the expressive power of collective attacks. Argument & Computation, 10(2), 191–230. [bib]
  23. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2019). Founded World Views with Autoepistemic Equilibrium Logic. CoRR, abs/1902.07741. [bib]
  24. Fichte, J. K., & Hecher, M. (2019). Treewidth and Counting Projected Answer Sets. CoRR, abs/1903.11316. [bib]
  25. Gebser, M., Maratea, M., & Ricca, F. (2019). The Seventh Answer Set Programming Competition: Design and Results. CoRR, abs/1904.09134. [bib]
  26. Hecher, M. (2019). Answer Set Solving exploiting Treewidth and its Limits. CoRR, abs/1905.01688. [bib]
  27. Lühne, P. (2019). Discovering and Proving Invariants in Answer Set Programming and Planning. CoRR, abs/1905.03196. [bib]
  28. Wanko, P. (2019). Design Space Exploration via Answer Set Programming Modulo Theories. CoRR, abs/1905.05248. [bib]
  29. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2019). Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning. CoRR, abs/1905.10621. [pdf] [bib]
  30. Fandinno, J. (2019). Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting. CoRR, abs/1907.09247. [bib]
  31. Alviano, M., Dodaro, C., Fichte, J. K., Hecher, M., Philipp, T., & Rath, J. (2019). Inconsistency Proofs for ASP: The ASP-DRUPE Format. CoRR, abs/1907.10389. [bib]
  32. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2019). Revisiting Explicit Negation in Answer Set Programming. CoRR, abs/1907.11467. [bib]
  33. Aguado, F., Cabalar, P., Fandinno, J., Muñiz, B., Pérez, G., & Suárez, F. (2019). A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation. ICLP Technical Communications, 306, 266–272. [pdf] [bib]
  34. Fichte, J. K., Hecher, M., & Pfandler, A. (2019). TE-ETH: Lower Bounds for QBFs of Bounded Treewidth. CoRR, abs/1910.01047. [bib]
  35. Saldanha, E.-A. D., & Fandinno, J. (2019). On the Relation between Weak Completion Semantics and Answer Set Semantics. CoRR, abs/1910.07278. [pdf] [bib]
  36. Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Maratea, M., Ricca, F., & Schaub, T. (2019). ASP-Core-2 Input Language Format. CoRR, abs/1911.04326. [pdf] [bib]
  37. Fandinno, J., & Fichte, J. K. (2019). Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019. CoRR, abs/1912.09211. [bib]
  38. Obermeier, P., Romero, J., & Schaub, T. (2019). Multi-Shot Stream Reasoning in Answer Set Programming: A Preliminary Report. OJDB, 6(1), 33–38. [pdf] [bib]
  39. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2019). Revisiting Explicit Negation in Answer Set Programming. TPLP, 19(5-6), 908–924. [pdf] [bib]
  40. Alviano, M., Dodaro, C., Fichte, J. K., Hecher, M., Philipp, T., & Rath, J. (2019). Inconsistency Proofs for ASP: The ASP - DRUPE Format. TPLP, 19(5-6), 891–907. [bib]
  41. 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]
  42. Fandinno, J. (2019). Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting. TPLP, 19(5-6), 671–687. [pdf] [bib]
  43. Fandinno, J., & Schulz, C. (2019). Answering the "why" in answer set programming - A survey of explanation approaches. TPLP, 19(2), 114–203. [pdf] [bib]
  44. Frioux, C., Schaub, T., Schellhorn, S., Siegel, A., & Wanko, P. (2019). Hybrid metabolic network completion. TPLP, 19(1), 83–108. [pdf] [bib]
  45. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2019). Multi-shot ASP solving with clingo. TPLP, 19(1), 27–82. [pdf] [bib]

2018

  1. Schäpers, B., Niemueller, T., Lakemeyer, G., Gebser, M., & Schaub, T. (2018). ASP-Based Time-Bounded Planning for Logistics Robots. ICAPS, 509–517. [pdf] [bib]
  2. 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]
  3. Razzaq, M., Kaminski, R., Romero, J., Schaub, T., Bourdon, J., & Guziolowski, C. (2018). Computing Diverse Boolean Networks from Phosphoproteomic Time Series Data. CMSB, 11095, 59–74. [pdf] [bib]
  4. 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]
  5. Cayrol, C., Fandinno, J., del Cerro, L. F., & Lagasquie-Schiex, M.-C. (2018). Structure-Based Semantics of Argumentation Frameworks with Higher-Order Attacks and Supports. COMMA, 305, 29–36. [bib]
  6. Dvorák, W., Fandinno, J., & Woltran, S. (2018). On the Expressive Power of Collective Attacks. COMMA, 305, 49–60. [bib]
  7. Fichte, J. K., Hecher, M., Lodha, N., & Szeider, S. (2018). An SMT Approach to Fractional Hypertree Width. CP, 11008, 109–127. [bib]
  8. Neubauer, K., Wanko, P., Schaub, T., & Haubelt, C. (2018). Exact multi-objective design space exploration using ASPmT. DATE, 257–260. [pdf] [bib]
  9. Fichte, J. K., Hecher, M., Woltran, S., & Zisser, M. (2018). Weighted Model Counting on the GPU by Exploiting Small Treewidth. ESA, 112, 28:1–28:16. [bib]
  10. Cayrol, C., Fandinno, J., del Cerro, L. F., & Lagasquie-Schiex, M.-C. (2018). Argumentation Frameworks with Recursive Attacks and Evidence-Based Supports. FoIKS, 10833, 150–169. [bib]
  11. Obermeier, P. (2018). Scalable Robotic Intra-Logistics with Answer Set Programming. ICLP (Technical Communications), 64, 24:1–24:5. [bib]
  12. Gebser, M., Leone, N., Maratea, M., Perri, S., Ricca, F., & Schaub, T. (2018). Evaluation Techniques and Systems for Answer Set Programming: a Survey. IJCAI, 5450–5456. [bib]
  13. Alviano, M., Romero, J., & Schaub, T. (2018). Preference Relations by Approximation. KR, 2–11. [pdf] [bib]
  14. Bosser, A.-G., Cabalar, P., Diéguez Martı́n, & Schaub, T. (2018). Introducing Temporal Stable Models for Linear Dynamic Logic. KR, 12–21. [pdf] [bib]
  15. Fandinno, J., & del Cerro, L. F. (2018). Constructive Logic Covers Argumentation and Logic Programming. KR, 128–137. [pdf] [bib]
  16. Fichte, J. K., & Hecher, M. (2018). Exploiting Treewidth for Counting Projected Answer Sets. KR, 639–640. [bib]
  17. Fichte, J. K., Hecher, M., & Schindler, I. (2018). Default Logic and Bounded Treewidth. LATA, 10792, 130–142. [pdf] [bib]
  18. 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]
  19. Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2018). Exploiting Treewidth for Projected Model Counting and Its Limits. SAT, 10929, 165–184. [bib]
  20. Cabalar, P., Kaminski, R., Schaub, T., & Schuhmann, A. (2018). Temporal Answer Set Programming on Finite Traces. CoRR, abs/1804.10227. [pdf] [bib]
  21. 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]
  22. 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]
  23. Cabalar, P., Fandinno, J., del Cerro, L. F., & Pearce, D. (2018). Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates. CoRR, abs/1805.00660. [bib]
  24. Fichte, J. K., Morak, M., Hecher, M., & Woltran, S. (2018). Exploiting Treewidth for Projected Model Counting and its Limits. CoRR, abs/1805.05445. [bib]
  25. Frioux, C., Schaub, T., Schellhorn, S., Siegel, A., & Wanko, P. (2018). Hybrid Metabolic Network Completion. CoRR, abs/1808.04149. [pdf] [bib]
  26. Fandinno, J., & Schulz, C. (2018). Answering the "why" in Answer Set Programming - A Survey of Explanation Approaches. CoRR, abs/1809.08034. [bib]
  27. Lifschitz, V., Lühne, P., & Schaub, T. (2018). anthem: Transforming gringo Programs into First-Order Theories (Preliminary Report). CoRR, abs/1810.00453. [pdf] [bib]
  28. Fichte, J. K., Hecher, M., & Meier, A. (2018). Counting Complexity for Reasoning in Abstract Argumentation. CoRR, abs/1811.11501. [bib]
  29. Fandinno, J., & Fichte, J. K. (2018). Proceedings of the elevent Workshop on Answer Set Programming and Other Computing Paradigms 2018. CoRR, abs/1812.03508. [bib]
  30. Dimopoulos, Y., Gebser, M., Lühne, P., Romero, J., & Schaub, T. (2018). plasp 3: Towards Effective ASP Planning. CoRR, abs/1812.04491. [pdf] [bib]
  31. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2018). Splitting Epistemic Logic Programs. CoRR, abs/1812.08763. [bib]
  32. 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]
  33. Abseher, M., Bliem, B., Hecher, M., Moldovan, M., & Woltran, S. (2018). Dynamic Programming on Tree Decompositions with D-FLAT. KI, 32(2-3), 191–192. [bib]
  34. Brewka, G., Ellmauthaler, S., Kern-Isberner, G., Obermeier, P., Ostrowski, M., Romero, J., Schaub, T., & Schieweck, S. (2018). Advanced Solving Technology for Dynamic and Reactive Applications. KI, 32(2-3), 199–200. [pdf] [bib]
  35. Brewka, G., Schaub, T., & Woltran, S. (2018). Interview with Gerhard Brewka. KI, 32(2-3), 219–221. [pdf] [bib]
  36. 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]
  37. Haubelt, C., Neubauer, K., Schaub, T., & Wanko, P. (2018). Design Space Exploration with Answer Set Programming. KI, 32(2-3), 205–206. [pdf] [bib]
  38. Lifschitz, V., Schaub, T., & Woltran, S. (2018). Interview with Vladimir Lifschitz. KI, 32(2-3), 213–218. [pdf] [bib]
  39. Schaub, T., & Woltran, S. (2018). Special Issue on Answer Set Programming. KI, 32(2-3), 101–103. [pdf] [bib]
  40. Schaub, T., & Woltran, S. (2018). Answer set programming unleashed! KI, 32(2-3), 105–108. [pdf] [bib]
  41. Cabalar, P., Fandinno, J., del Cerro, L. F., & Pearce, D. (2018). Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates. TPLP, 18(3-4), 390–405. [pdf] [bib]
  42. Cabalar, P., Kaminski, R., Schaub, T., & Schuhmann, A. (2018). Temporal Answer Set Programming on Finite Traces. TPLP, 18(3-4), 406–420. [pdf] [bib]
  43. 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]
  44. 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]
  45. Ostrowski, M. (2018). Modern constraint answer set solving [PhD thesis]. University of Potsdam, Germany. [pdf] [bib]
  46. 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. Cayrol, C., Fandinno, J., del Cerro, L. F., & Lagasquie-Schiex, M.-C. (2017). Valid Attacks in Argumentation Frameworks with Recursive Attacks. COMMONSENSE, 2052. [bib]
  2. Neubauer, K., Wanko, P., Schaub, T., & Haubelt, C. (2017). Enhancing symbolic system synthesis through ASPmT with partial assignment evaluation. DATE, 306–309. [pdf] [bib]
  3. Cabalar, P., Fandinno, J., del Cerro, L. F., Pearce, D., & Valverde Agustı́n. (2017). On the Properties of Atom Definability and Well-Supportedness in Logic Programming. EPIA, 10423, 624–636. [pdf] [bib]
  4. Lindauer, M., Hutter, F., Hoos, H. H., & Schaub, T. (2017). AutoFolio: An Automatically Configured Algorithm Selector (Extended Abstract). IJCAI, 5025–5029. [bib]
  5. Nguyen, V., Obermeier, P., Son, T. C., Schaub, T., & Yeoh, W. (2017). Generalized Target Assignment and Path Finding Using Answer Set Programming. IJCAI, 1216–1223. [pdf] [bib]
  6. Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2017). DynASP2.5: Dynamic Programming on Tree Decompositions in Action. IPEC, 89, 17:1–17:13. [pdf] [bib]
  7. Romero, J., Schaub, T., & Son, T. C. (2017). Generalized Answer Set Planning with Incomplete Information. ASPOCP@LPNMR, 1868. [pdf] [bib]
  8. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2017). Forgetting Auxiliary Atoms in Forks. ASPOCP@LPNMR, 1868. [bib]
  9. Banbara, M., Inoue, K., Kaneyuki, H., Okimoto, T., Schaub, T., Soh, T., & Tamura, N. (2017). catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming. LPNMR, 10377, 265–278. [pdf] [bib]
  10. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2017). Gelfond-Zhang Aggregates as Propositional Formulas. LPNMR, 10377, 117–131. [pdf] [bib]
  11. Dimopoulos, Y., Gebser, M., Lühne, P., Romero, J., & Schaub, T. (2017). plasp 3: Towards Effective ASP Planning. LPNMR, 10377, 286–300. [pdf] [bib]
  12. Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2017). Answer Set Solving with Bounded Treewidth Revisited. LPNMR, 10377, 132–145. [pdf] [bib]
  13. Fichte, J. K., Kronegger, M., & Woltran, S. (2017). A Multiparametric View on Answer Set Programming. ASPOCP@LPNMR, 1868. [pdf] [bib]
  14. Fichte, J. K., & Szeider, S. (2017). Backdoor Trees for Answer Set Programming. ASPOCP@LPNMR, 1868. [pdf] [bib]
  15. Frioux, C., Schaub, T., Schellhorn, S., Siegel, A., & Wanko, P. (2017). Hybrid Metabolic Network Completion. LPNMR, 10377, 308–321. [pdf] [bib]
  16. Gebser, M., Maratea, M., & Ricca, F. (2017). The Design of the Seventh Answer Set Programming Competition. LPNMR, 10377, 3–9. [pdf] [bib]
  17. 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]
  18. Kaminski, R., Schaub, T., & Wanko, P. (2017). A Tutorial on Hybrid Answer Set Solving with clingo. Reasoning Web, 10370, 167–203. [pdf] [bib]
  19. Fichte, J. K., Lodha, N., & Szeider, S. (2017). SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. SAT, 10491, 401–411. [pdf] [bib]
  20. Lindauer, M., Hoos, H. H., Leyton-Brown, K., & Schaub, T. (2017). Automatic construction of parallel portfolios via algorithm configuration. Artif. Intell., 244, 272–290. [pdf] [bib]
  21. Guyet, T., Moinard, Y., Quiniou, R., & Schaub, T. (2017). Efficiency Analysis of ASP Encodings for Sequential Pattern Mining Tasks. CoRR, abs/1711.05090. [bib]
  22. Banbara, M., Kaufmann, B., Ostrowski, M., & Schaub, T. (2017). Clingcon: The Next Generation. CoRR, abs/1705.04569. [bib]
  23. Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2017). Answer Set Solving with Bounded Treewidth Revisited. CoRR, abs/1702.02890. [bib]
  24. Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2017). DynASP2.5: Dynamic Programming on Tree Decompositions in Action. CoRR, abs/1706.09370. [bib]
  25. Fichte, J. K., Hecher, M., & Schindler, I. (2017). Default Logic and Bounded Treewidth. CoRR, abs/1706.09393. [bib]
  26. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2017). Multi-shot ASP solving with clingo. CoRR, abs/1705.09811. [pdf] [bib]
  27. 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]
  28. Gebser, M., Maratea, M., & Ricca, F. (2017). The Sixth Answer Set Programming Competition. J. Artif. Intell. Res., 60, 41–95. [pdf] [bib]
  29. 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]
  30. Banbara, M., Kaufmann, B., Ostrowski, M., & Schaub, T. (2017). Clingcon: The next generation. TPLP, 17(4), 408–461. [pdf] [bib]
  31. Cabalar, P., & Fandinno, J. (2017). Enablers and inhibitors in causal justifications of logic programs. TPLP, 17(1), 49–74. [pdf] [bib]
  32. 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]
  33. Romero, J. (2017). asprin: Answer Set Programming with Preferences. BTW, 159–162. [pdf] [bib]
  34. Everardo, F. (2017). Towards an Automated Multitrack Mixing Tool using Answer Set Programming. SMC, 422–428. [pdf] [bib]
  35. Hecher, M. (2017). Structure-Driven Answer-Set Solving. DC@LPNMR. [pdf] [bib]
  36. Romero, J. (2017). Extending Answer Set Programming with Declarative Heuristics, Preferences, and Online Planning. DC@LPNMR, 28–30. [pdf] [bib]
  37. Lühne, P. (2017). Discovering and Proving Invariants in Answer Set Programming and Planning. DC@LPNMR, 17–21. [pdf] [bib]
  38. Ostrowski, M. (2017). Modern Constraint Answer Set Solving. DC@LPNMR, 22–27. [pdf] [bib]
  39. Everardo, F. (2017). Sampling and Search Space with Answer Set Programming. DC@LPNMR, 1–4. [pdf] [bib]
  40. Schellhorn, S. (2017). Theory Reasoning with Answer Set Programming. DC@LPNMR, 31–34. [pdf] [bib]

2016

  1. Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2016). Subset Minimization in Dynamic Programming on Tree Decompositions. AAAI Workshop: Beyond NP, WS-16-05. [bib]
  2. Gebser, M., Maratea, M., & Ricca, F. (2016). What’s Hot in the Answer Set Programming Competition. AAAI, 4327–4329. [bib]
  3. Son, T. C., Sabuncu, O., Schulz-Hanke, C., Schaub, T., & Yeoh, W. (2016). Solving Goal Recognition Design Using ASP. AAAI, 3181–3187. [pdf] [bib]
  4. Bliem, B., Hecher, M., & Woltran, S. (2016). On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. COMMA, 287, 107–118. [bib]
  5. Becker, K., Bockmayer, A., Gebser, M., & Schaub, T. (2016). Answer Set Programming for Logical Analysis of Data. WCB@CP, 15–26. [bib]
  6. Vicol, P., Delgrande, J. P., & Schaub, T. (2016). A Minimization-Based Approach to Iterated Multi-Agent Belief Change. ECAI, 285, 1221–1229. [bib]
  7. Guyet, T., Moinard, Y., Quiniou, R., & Schaub, T. (2016). Fouille de motifs séquentiels avec ASP. EGC, E-30, 39–50. [bib]
  8. Guyet, T., Moinard, Y., Quiniou, R., & Schaub, T. (2016). Efficiency Analysis of ASP Encodings for Sequential Pattern Mining Tasks. EGC (Best of Volume), 732, 41–81. [bib]
  9. Romero, J., Schaub, T., & Wanko, P. (2016). Computing Diverse Optimal Stable Models. ICLP (Technical Communications), 52, 3:1–3:14. [pdf] [bib]
  10. Bomanson, J., Gebser, M., & Janhunen, T. (2016). Rewriting Optimization Statements in Answer-Set Programs. ICLP (Technical Communications), 52, 5:1–5:15. [pdf] [bib]
  11. Gebser, M., Kaminski, R., Kaufmann, B., Lühne, P., Romero, J., & Schaub, T. (2016). Answer Set Solving with Generalized Learned Constraints. ICLP (Technical Communications), 52, 9:1–9:15. [pdf] [bib]
  12. 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]
  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. Wanko, P. (2016). Scalable Design Space Exploration via Answer Set Programming. ICLP (Technical Communications), 52, 23:1–23:11. [bib]
  15. Alviano, M., Faber, W., & Gebser, M. (2016). From Non-Convex Aggregates to Monotone Aggregates in ASP. IJCAI, 4100–4194. [pdf] [bib]
  16. Bliem, B., Kaufmann, B., Schaub, T., & Woltran, S. (2016). ASP for Anytime Dynamic Programming on Tree Decompositions. IJCAI, 979–986. [pdf] [bib]
  17. Cabalar, P., Kaminski, R., Ostrowski, M., & Schaub, T. (2016). An ASP Semantics for Default Reasoning with Constraints. IJCAI, 1015–1021. [pdf] [bib]
  18. Gebser, M., Guyet, T., Quiniou, R., Romero, J., & Schaub, T. (2016). Knowledge-Based Sequence Mining with ASP. IJCAI, 1497–1504. [pdf] [bib]
  19. Gebser, M., Janhunen, T., Kaminski, R., Schaub, T., & Tasharrofi, S. (2016). Writing Declarative Specifications for Clauses. JELIA, 10021, 256–271. [pdf] [bib]
  20. Muñoz, J., & Everardo, F. (2016). Urban land use planning using answer set programming - preliminary report -. LANMR, 1659, 82–89. [pdf] [bib]
  21. Fichte, J. K., Meier, A., & Schindler, I. (2016). Strong Backdoors for Default Logic. SAT, 9710, 45–59. [bib]
  22. 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]
  23. Gebser, M., & Schaub, T. (2016). Modeling and Language Extensions. AI Magazine, 37(3), 33–44. [pdf] [bib]
  24. Kaufmann, B., Leone, N., Perri, S., & Schaub, T. (2016). Grounding and Solving in Answer Set Programming. AI Magazine, 37(3), 25–32. [pdf] [bib]
  25. Ostrowski, M., Paulevé Loı̈c, Schaub, T., Siegel, A., & Guziolowski, C. (2016). Boolean network identification from perturbation time series data combining dynamics abstraction and logic programming. Biosystems, 149, 139–153. [pdf] [bib]
  26. Cabalar, P., & Fandinno, J. (2016). Enablers and Inhibitors in Causal Justifications of Logic Programs. CoRR, abs/1602.06897. [bib]
  27. Cabalar, P., & Fandinno, J. (2016). Justifications for Programs with Disjunctive and Causal-choice Rules. CoRR, abs/1608.00870. [bib]
  28. Fandinno, J. (2016). Deriving Conclusions From Non-Monotonic Cause-Effect Relations. CoRR, abs/1608.00867. [bib]
  29. Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2016). Counting Answer Sets via Dynamic Programming. CoRR, abs/1612.07601. [bib]
  30. Fichte, J. K., Meier, A., & Schindler, I. (2016). Strong Backdoors for Default Logic. CoRR, abs/1602.06052. [bib]
  31. Gebser, M., Kaminski, R., & Schaub, T. (2016). Grounding Recursive Aggregates: Preliminary Report. CoRR, abs/1603.03884. [pdf] [bib]
  32. Sabuncu, O., Schaub, T., & Schulz-Hanke, C. (2016). Formalizing Multi-Agent Systems Using Action Descriptions in Single Agent Perspective. CoRR, abs/1611.06413. [bib]
  33. 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]
  34. Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2016). D-FLAT\(^\mbox2\): Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Fundam. Inform., 147(1), 27–61. [bib]
  35. Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., & Schaub, T. (2016). Answer Set Programming Modulo Acyclicity. Fundam. Inform., 147(1), 63–91. [pdf] [bib]
  36. Fandinno, J. (2016). Towards Deriving Conclusions from Cause-effect Relations. Fundam. Inform., 147(1), 93–131. [bib]
  37. Cabalar, P., & Fandinno, J. (2016). Justifications for programs with disjunctive and causal-choice rules. TPLP, 16(5-6), 587–603. [pdf] [bib]
  38. Fandinno, J. (2016). Deriving conclusions from non-monotonic cause-effect relations. TPLP, 16(5-6), 670–687. [pdf] [bib]
  39. 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]
  40. Gebser, M., Janhunen, T., & Rintanen, J. (2016). Declarative Encodings of Acyclicity Properties. Journal of Logic and Computation. [pdf] [bib]

2015

  1. Brewka, G., Delgrande, J. P., Romero, J., & Schaub, T. (2015). asprin: Customizing Answer Set Preferences without a Headache. AAAI, 1467–1474. [pdf] [bib]
  2. Heule, M., & Schaub, T. (2015). What’s Hot in the SAT and ASP Competitions. AAAI, 4322–4323. [bib]
  3. Lindauer, M., Hoos, H. H., Hutter, F., & Schaub, T. (2015). AutoFolio: Algorithm Configuration for Algorithm Selection. AAAI Workshop: Algorithm Configuration, WS-15-01. [bib]
  4. Cabalar, P., & Fandiño, J. (2015). Explaining Preferences and Preferring Explanations. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 9060, 218–232. [bib]
  5. Gebser, M., Kaminski, R., Obermeier, P., & Schaub, T. (2015). Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 9060, 17–32. [pdf] [bib]
  6. Ostrowski, M., Paulevé Loı̈c, Schaub, T., Siegel, A., & Guziolowski, C. (2015). Boolean Network Identification from Multiplex Time Series Data. CMSB, 9308, 170–181. [pdf] [bib]
  7. Gebser, M., Ryabokon, A., & Schenner, G. (2015). Solving combined configuration problems: a heuristic approach. Configuration Workshop, 1453, 55–59. [bib]
  8. Biewer, A., Andres, B., Gladigau, J., Schaub, T., & Haubelt, C. (2015). A symbolic system synthesis approach for hard real-time systems based on coordinated SMT-solving. DATE, 357–362. [pdf] [bib]
  9. Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. LPNMR, 9345, 32–39. [pdf] [bib]
  10. Andres, B., Biewer, A., Romero, J., Haubelt, C., & Schaub, T. (2015). Improving Coordinated SMT-Based System Synthesis by Utilizing Domain-Specific Heuristics. LPNMR, 9345, 55–68. [pdf] [bib]
  11. Andres, B., Rajaratnam, D., Sabuncu, O., & Schaub, T. (2015). Integrating ASP into ROS for Reasoning in Robots. LPNMR, 9345, 69–82. [pdf] [bib]
  12. Banbara, M., Gebser, M., Inoue, K., Ostrowski, M., Peano, A., Schaub, T., Soh, T., Tamura, N., & Weise, M. (2015). aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming. LPNMR, 9345, 112–126. [pdf] [bib]
  13. Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., & Schaub, T. (2015). Answer Set Programming Modulo Acyclicity. LPNMR, 9345, 143–150. [pdf] [bib]
  14. Brewka, G., Delgrande, J. P., Romero, J., & Schaub, T. (2015). Implementing Preferences with asprin. LPNMR, 9345, 158–172. [pdf] [bib]
  15. Cabalar, P., & Fandinno, J. (2015). Enablers and Inhibitors in Causal Justifications of Logic Programs. LPNMR, 9345, 199–212. [pdf] [bib]
  16. Gebser, M., Janhunen, T., Jost, H., Kaminski, R., & Schaub, T. (2015). ASP Solving for Expanding Universes. LPNMR, 9345, 354–367. [pdf] [bib]
  17. Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., & Schaub, T. (2015). Progress in clasp Series 3. LPNMR, 9345, 368–383. [pdf] [bib]
  18. Gebser, M., Maratea, M., & Ricca, F. (2015). The Design of the Sixth Answer Set Programming Competition - - Report -. LPNMR, 9345, 531–544. [pdf] [bib]
  19. Gebser, M., Ryabokon, A., & Schenner, G. (2015). Combining Heuristics for Configuration Problems Using Answer Set Programming. LPNMR, 9345, 384–397. [pdf] [bib]
  20. Vicol, P., Delgrande, J. P., & Schaub, T. (2015). An Implementation of Consistency-Based Multi-agent Belief Change Using ASP. LPNMR, 9345, 480–487. [pdf] [bib]
  21. Fichte, J. K., & Szeider, S. (2015). Backdoors to tractable answer set programming. Artif. Intell., 220, 64–103. [bib]
  22. Alviano, M., Faber, W., & Gebser, M. (2015). Rewriting recursive aggregates in answer set programming: back to monotonicity. CoRR, abs/1507.03923. [bib]
  23. Fichte, J. K., Truszczynski, M., & Woltran, S. (2015). Dual-normal Logic Programs - the Forgotten Class. CoRR, abs/1507.05388. [bib]
  24. Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., & Schaub, T. (2015). Abstract Gringo. CoRR, abs/1507.06576. [bib]
  25. Gebser, M., Obermeier, P., & Schaub, T. (2015). Interactive Answer Set Programming - Preliminary Report. CoRR, abs/1511.01261. [pdf] [bib]
  26. Lindauer, M. T., Hoos, H. H., Hutter, F., & Schaub, T. (2015). AutoFolio: An Automatically Configured Algorithm Selector. J. Artif. Intell. Res., 53, 745–778. [bib]
  27. Videla, S., Guziolowski, C., Eduati, F., Thiele, S., Gebser, M., Nicolas, J., Saez-Rodriguez, J., Schaub, T., & Siegel, A. (2015). Learning Boolean logic models of signaling networks with ASP. Theor. Comput. Sci., 599, 79–101. [pdf] [bib]
  28. Fichte, J. K., & Szeider, S. (2015). Backdoors to Normality for Disjunctive Logic Programs. ACM Trans. Comput. Log., 17(1), 7:1–7:23. [bib]
  29. 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]
  30. Fichte, J. K., Truszczynski, M., & Woltran, S. (2015). Dual-normal logic programs - the forgotten class. TPLP, 15(4-5), 495–510. [bib]
  31. Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., & Schaub, T. (2015). Abstract gringo. TPLP, 15(4-5), 449–463. [pdf] [bib]
  32. 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]
  33. Kaufmann, B. (2015). High performance answer set solving [PhD thesis]. University of Potsdam. [bib]
  34. Opolka, S., Obermeier, P., & Schaub, T. (2015). Automatic Genre-Dependent Composition using Answer Set Programming. ISEA. [pdf] [bib]
  35. Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. ASPOCP@LPNMR. [pdf] [bib]
  36. Gebser, M., Janhunen, T., Kaminski, R., Schaub, T., & Tasharrofi, S. (2015). Writing Declarative Specifications for Clauses. GTTV@LPNMR. [pdf] [bib]
  37. Gebser, M., Kaminski, R., & Schaub, T. (2015). Grounding Recursive Aggregates: Preliminary Report. GTTV@LPNMR. [pdf] [bib]

2014

  1. Davila, J. R., Saffidine, A., & Thielscher, M. (2014). Solving the Inferential Frame Problem in the General Game Description Language. AAAI, 515–521. [pdf] [bib]
  2. Schaub, T., Friedrich, G., & O’Sullivan, B. (Eds.). (2014). ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014) (Vol. 263). IOS Press. [bib]
  3. Gebser, M., Janhunen, T., & Rintanen, J. (2014). Answer Set Programming as SAT modulo Acyclicity. ECAI, 263, 351–356. [pdf] [bib]
  4. Vogiatzaki, E., Gravezas, Y., Dalezios, N., Biswas, D., Cranny, A., Ortmann, S., Langendörfer, P., Lamprinos, I., Giannakopoulou, G., Achner, J., Klemke, J., & Jost, H. (2014). Telemedicine system for game-based rehabilitation of stroke patients in the FP7-"StrokeBack" project. EuCNC, 1–5. [pdf] [bib]
  5. Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., & Woltran, S. (2014). The D-FLAT System for Dynamic Programming on Tree Decompositions. JELIA, 8761, 558–572. [bib]
  6. Bomanson, J., Gebser, M., & Janhunen, T. (2014). Improving the Normalization of Weight Rules in Answer Set Programs. JELIA, 8761, 166–180. [pdf] [bib]
  7. Cabalar, P., Fandiño, J., & Fink, M. (2014). A Complexity Assessment for Queries Involving Sufficient and Necessary Causes. JELIA, 8761, 297–310. [pdf] [bib]
  8. Gebser, M., Janhunen, T., & Rintanen, J. (2014). SAT Modulo Graphs: Acyclicity. JELIA, 8761, 137–151. [pdf] [bib]
  9. Gebser, M., Janhunen, T., & Rintanen, J. (2014). ASP Encodings of Acyclicity Properties. KR. [pdf] [bib]
  10. Hutter, F., López-Ibáñez, M., Fawcett, C., Lindauer, M. T., Hoos, H. H., Leyton-Brown, K., & Stützle, T. (2014). AClib: A Benchmark Library for Algorithm Configuration. LION, 8426, 36–40. [pdf] [bib]
  11. Cerexhe, T. J., Gebser, M., & Thielscher, M. (2014). Online Agent Logic Programming with oClingo. PRICAI, 8862, 945–957. [pdf] [bib]
  12. Guziolowski, C., Videla, S., Eduati, F., Thiele, S., Cokelaer, T., Siegel, A., & Saez-Rodriguez, J. (2014). Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming. Bioinformatics, 30(13), 1942. [pdf] [bib]
  13. Cabalar, P., Fandinno, J., & Fink, M. (2014). Causal Graph Justifications of Logic Programs. CoRR, abs/1409.7281. [bib]
  14. Calimeri, F., Gebser, M., Maratea, M., & Ricca, F. (2014). The Design of the Fifth Answer Set Programming Competition. CoRR, abs/1405.3710. [bib]
  15. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014). Clingo = ASP + Control: Preliminary Report. CoRR, abs/1405.3694. [bib]
  16. Hoos, H., Kaminski, R., Lindauer, M. T., & Schaub, T. (2014). Solver Scheduling via Answer Set Programming. CoRR, abs/1401.1024. [bib]
  17. Hoos, H., Lindauer, M. T., & Schaub, T. (2014). claspfolio 2: Advances in Algorithm Selection for Answer Set Programming. CoRR, abs/1405.1520. [bib]
  18. Cabalar, P., Fandinno, J., & Fink, M. (2014). Causal Graph Justifications of Logic Programs. TPLP, 14(4-5), 603–618. [pdf] [bib]
  19. Hoos, H., Lindauer, M. T., & Schaub, T. (2014). claspfolio 2: Advances in Algorithm Selection for Answer Set Programming. TPLP, 14(4-5), 569–585. [pdf] [bib]
  20. Schaub, T., Siegel, A., & Videla, S. (2014). Reasoning on the response of logical signaling networks with Answer Set Programming. In Logical Modeling of Biological Systems (pp. 49–92). John Wiley & sons. [bib]
  21. Brewka, G., Delgrande, J. P., Romero, J., & Schaub, T. (2014). Are Preferences Giving You a Headache? — Take asprin! ASPOCP@LPNMR. [pdf] [bib]
  22. Gebser, M., Janhunen, T., Kaminski, R., Schaub, T., & Tasharrofi, S. (2014). Declarative Encodings of Acyclicity Properties. ASPOCP@LPNMR. [pdf] [bib]
  23. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014). Clingo = ASP + Control: Extended Report. University of Potsdam. [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]
  2. Schaub, T. (2013). Answer Set Programming: Boolean Constraint Solving for Knowledge Representation and Reasoning. CP, 8124, 3–4. [bib]
  3. Bisiani, R., Merico, D., Pinardi, S., Dominoni, M., Cesta, A., Orlandini, A., Rasconi, R., Suriano, M., Umbrico, A., Sabuncu, O., Schaub, T., D’Aloisi, D., Nicolussi, R., Papa, F., Bouglas, V., Giakas, G., Kavatzikidis, T., & Bonfiglio, S. (2013). Fostering Social Interaction of Home-Bound Elderly People: The EasyReach System. IEA/AIE, 7906, 33–42. [pdf] [bib]
  4. Gebser, M., Kaufmann, B., & Schaub, T. (2013). Advanced Conflict-Driven Disjunctive Answer Set Solving. IJCAI, 912–918. [pdf] [bib]
  5. Hoos, H. H., Kaufmann, B., Schaub, T., & Schneider, M. (2013). Robust Benchmark Set Selection for Boolean Constraint Solvers. LION, 7997, 138–152. [pdf] [bib]
  6. Andres, B., Gebser, M., Schaub, T., Haubelt, C., Reimann, F., & Glaß, M. (2013). Symbolic System Synthesis Using Answer Set Programming. LPNMR, 8148, 79–91. [pdf] [bib]
  7. Andres, B., Sauer, M., Gebser, M., Schubert, T., Becker, B., & Schaub, T. (2013). Accurate Computation of Sensitizable Paths Using Answer Set Programming. LPNMR, 8148, 92–101. [pdf] [bib]
  8. Bordron, P., Eveillard, D., Maass, A., Siegel, A., & Thiele, S. (2013). An ASP Application in Integrative Biology: Identification of Functional Gene Units. LPNMR, 8148, 206–218. [bib]
  9. Cerexhe, T. J., Sabuncu, O., & Thielscher, M. (2013). Evaluating Answer Set Clause Learning for General Game Playing. LPNMR, 8148, 219–232. [pdf] [bib]
  10. 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. LPNMR, 8148, 245–256. [pdf] [bib]
  11. Gebser, M., Glase, T., Sabuncu, O., & Schaub, T. (2013). Matchmaking with Answer Set Programming. LPNMR, 8148, 342–347. [pdf] [bib]
  12. Gebser, M., Jost, H., Kaminski, R., Obermeier, P., Sabuncu, O., Schaub, T., & Schneider, M. (2013). Ricochet Robots: A Transverse ASP Benchmark. LPNMR, 8148, 348–360. [pdf] [bib]
  13. 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. MBMV, 35–46. [pdf] [bib]
  14. Guziolowski, C., Videla, S., Eduati, F., Thiele, S., Cokelaer, T., Siegel, A., & Saez-Rodriguez, J. (2013). Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming. Bioinformatics, 29(18), 2320–2326. [bib]
  15. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2013). Answer Set Programming for Stream Reasoning. CoRR, abs/1301.1392. [bib]
  16. Andres, B., Obermeier, P., Sabuncu, O., Schaub, T., & Rajaratnam, D. (2013). ROSoClingo: A ROS package for ASP-based robot control. CoRR, abs/1307.7398. [pdf] [bib]
  17. 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]
  18. Cabalar, P., & Fandinno, J. (2013). An Algebra of Causal Chains. CoRR, abs/1312.6134. [bib]
  19. Gebser, M., Obermeier, P., & Schaub, T. (2013). A System for Interactive Query Answering with Answer Set Programming. CoRR, abs/1312.6143. [bib]
  20. Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2013). A Model-Theoretic Approach to Belief Change in Answer Set Programming. ACM Trans. Comput. Log., 14(2), 14:1–14:46. [pdf] [bib]
  21. 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]
  22. Banbara, M., Soh, T., Tamura, N., Inoue, K., & Schaub, T. (2013). Answer set programming as a modeling language for course timetabling. TPLP, 13(4-5), 783–798. [pdf] [bib]
  23. Fandinno, J. (2013). Algebraic Approach to Causal Logic Programs. TPLP, 13(4-5-Online-Supplement). [bib]
  24. Gavanelli, M., & Gebser, M. (2013). The ICLP 2013 Doctoral Consortium. TPLP, 13(4-5-Online-Supplement). [bib]
  25. 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]
  26. König, A. (2013). Visualizing Answer Set Programming. TPLP, 13(4-5-Online-Supplement). [pdf] [bib]
  27. König, A., & Schaub, T. (2013). Monitoring and Visualizing Answer Set Solving. TPLP, 13(4-5-Online-Supplement). [pdf] [bib]
  28. Gebser, M., Obermeier, P., & Schaub, T. (2013). A system for interactive query answering with answer set programming. ASPOCP. [pdf] [bib]
  29. Andres, B., Obermeier, P., Sabuncu, O., Schaub, T., & Rajaratnam, D. (2013). ROSoClingo: A ROS package for ASP-based robot control. RSS-CP. [pdf] [bib]

2012

  1. Gebser, M., Kaufmann, R., & Schaub, T. (2012). Gearing Up for Effective ASP Planning. Correct Reasoning, 7265, 296–310. [pdf] [bib]
  2. Videla, S., Guziolowski, C., Eduati, F., Thiele, S., Grabe, N., Saez-Rodriguez, J., & Siegel, A. (2012). Revisiting the Training of Logic Models of Protein Signaling Networks with ASP. CMSB, 7605, 342–361. [pdf] [bib]
  3. Schaub, T. (2012). Answer Set Programming. FMCAD, 2. [bib]
  4. Andres, B., Kaufmann, B., Matheis, O., & Schaub, T. (2012). Unsatisfiability-based optimization in clasp. ICLP (Technical Communications), 17, 211–221. [pdf] [bib]
  5. Hoos, H., Kaminski, R., Schaub, T., & Schneider, M. T. (2012). aspeed: ASP-based Solver Scheduling. ICLP (Technical Communications), 17, 176–187. [pdf] [bib]
  6. Ostrowski, M. (2012). ASP modulo CSP: The clingcon system. ICLP (Technical Communications), 17, 458–463. [bib]
  7. Silverthorn, B., Lierler, Y., & Schneider, M. (2012). Surviving Solver Sensitivity: An ASP Practitioner’s Guide. ICLP (Technical Communications), 17, 164–175. [pdf] [bib]
  8. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2012). Stream Reasoning with Answer Set Programming: Preliminary Report. KR. [pdf] [bib]
  9. Schneider, M., & Hoos, H. H. (2012). Quantifying Homogeneity of Instance Sets for Algorithm Configuration. LION, 7219, 190–204. [pdf] [bib]
  10. Gebser, M., Kaufmann, B., & Schaub, T. (2012). Conflict-driven answer set solving: From theory to practice. Artif. Intell., 187, 52–89. [pdf] [bib]
  11. Videla, S., Guziolowski, C., Eduati, F., Thiele, S., Grabe, N., Saez-Rodriguez, J., & Siegel, A. (2012). Revisiting the Training of Logic Models of Protein Signaling Networks with a Formal Approach based on Answer Set Programming. CoRR, abs/1210.0690. [bib]
  12. Ostrowski, M., & Schaub, T. (2012). ASP modulo CSP: The clingcon system. CoRR, abs/1210.2287. [bib]
  13. Gebser, M., Kaufmann, B., & Schaub, T. (2012). Multi-threaded ASP Solving with clasp. CoRR, abs/1210.3265. [bib]
  14. Schaub, T. (2012). Préface. Revue d’Intelligence Artificielle, 26(1-2), 7. [bib]
  15. Gebser, M., Kaufmann, B., & Schaub, T. (2012). Multi-threaded ASP solving with clasp. TPLP, 12(4-5), 525–545. [pdf] [bib]
  16. Ostrowski, M., & Schaub, T. (2012). ASP modulo CSP: The clingcon system. TPLP, 12(4-5), 485–503. [pdf] [bib]
  17. Thiele, S. (2012). Modeling biological systems with Answer Set Programming [PhD thesis]. University of Potsdam. [bib]
  18. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2012). Answer Set Solving in Practice. Morgan & Claypool Publishers. [bib]
  19. Hoos, H., Leyton-Brown, K., Schaub, T., & Schneider, M. (2012). Algorithm Configuration for Portfolio-based Parallel SAT-Solving. CoCoMile. [pdf] [bib]
  20. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2012). Answer Set Programming for Stream Reasoning. ASPOCP@LPNMR. [pdf] [bib]
  21. Gebser, M., Grote, T., Kaminski, R., Obermeier, P., Sabuncu, O., & Schaub, T. (2012). Stream Reasoning with Answer Set Programming: Extended Version. Unpublished draft. [bib]
  22. Kaufmann, B., Schaub, T., & Schneider, M. (2012). clasp, claspfolio, aspeed: Three Solvers from the Answer Set Solving Collection Potassco. SAT Challenge, B-2012-2, 17–19. [pdf] [bib]
  23. Ostrowski, M., & Schaub, T. (2012). ASP modulo CSP: The clingcon system. CSPSAT. [pdf] [bib]
  24. Jost, H., Sabuncu, O., & Schaub, T. (2012). Suggesting New Interactions Related to Events in a Social Network for Elderly. Design and Implementation of Independent and Assisted Living Technology. [pdf] [bib]
  25. Andres, B., Sauer, M., Gebser, M., Schubert, T., Becker, B., & Schaub, T. (2012). Accurate Computation of Longest Sensitizable Paths using Answer Set Programming. ZuE. [pdf] [bib]

2011

  1. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2011). Challenges in Answer Set Solving. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 6565, 74–90. [pdf] [bib]
  2. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2011). Multi-Criteria Optimization in Answer Set Programming. ICLP (Technical Communications), 11, 1–10. [pdf] [bib]
  3. Ostrowski, M., Flouris, G., Schaub, T., & Antoniou, G. (2011). Evolution of Ontologies using ASP. ICLP (Technical Communications), 11, 16–27. [pdf] [bib]
  4. Ostrowski, M., Flouris, G., Schaub, T., & Antoniou, G. (2011). Evolution of Ontologies using ASP (No. TR-415; Issue TR-415). ICS. [pdf] [bib]
  5. Gebser, M., Sabuncu, O., & Schaub, T. (2011). Finite Model Computation via Answer Set Programming. IJCAI, 2626–2631. [pdf] [bib]
  6. Gebser, M., Grote, T., Kaminski, R., & Schaub, T. (2011). Reactive Answer Set Programming. LPNMR, 6645, 54–66. [pdf] [bib]
  7. Gebser, M., Kaminski, R., König, A., & Schaub, T. (2011). Advances in gringo Series 3. LPNMR, 6645, 345–351. [pdf] [bib]
  8. Gebser, M., Kaminski, R., Knecht, M., & Schaub, T. (2011). plasp: A Prototype for PDDL-Based Planning in ASP. LPNMR, 6645, 358–363. [pdf] [bib]
  9. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., & Schnor, B. (2011). Cluster-Based ASP Solving with claspar. LPNMR, 6645, 364–369. [pdf] [bib]
  10. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M. T., & Ziller, S. (2011). A Portfolio Solver for Answer Set Programming: Preliminary Report. LPNMR, 6645, 352–357. [pdf] [bib]
  11. Schaub, T. (2011). Knowledge-intensive Stream Reasoning. Log-IC@LPNMR, 738, 7. [pdf] [bib]
  12. 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]
  13. 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]
  14. Mileo, A., Schaub, T., Merico, D., & Bisiani, R. (2011). Knowledge-based multi-criteria optimization to support indoor positioning. Ann. Math. Artif. Intell., 62(3-4), 345–370. [pdf] [bib]
  15. Ostrowski, M., Schaub, T., Durzinsky, M., Marwan, W., & Wagler, A. (2011). Automatic Network Reconstruction using ASP. CoRR, abs/1107.5671. [bib]
  16. Gebser, M., Kaminski, R., & Schaub, T. (2011). Complex Optimization in Answer Set Programming. CoRR, abs/1107.5742. [bib]
  17. Gebser, M., Kaminski, R., & Schaub, T. (2011). aspcud: A Linux Package Configuration Tool Based on Answer Set Programming. LoCoCo, 65, 12–25. [pdf] [bib]
  18. Möller, M., Schneider, M. T., Wegner, M., & Schaub, T. (2011). Centurio, a General Game Player: Parallel, Java- and ASP-based. KI, 25(1), 17–24. [pdf] [bib]
  19. Durzinsky, M., Marwan, W., Ostrowski, M., Schaub, T., & Wagler, A. (2011). Automatic network reconstruction using ASP. TPLP, 11(4-5), 749–766. [pdf] [bib]
  20. Gebser, M., Kaminski, R., & Schaub, T. (2011). Complex optimization in answer set programming. TPLP, 11(4-5), 821–839. [pdf] [bib]
  21. Gebser, M., Lee, J., & Lierler, Y. (2011). On elementary loops of logic programs. TPLP, 11(6), 953–988. [bib]
  22. 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]
  23. Gebser, M. (2011). Proof theory and algorithms for answer set programming [PhD thesis]. University of Potsdam. [bib]
  24. Gebser, M., Kaminski, R., & Schaub, T. (2011). Complex optimization in answer set programming: Extended Version. [pdf] [bib]
  25. 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]

2010

  1. Mileo, A., Schaub, T., Merico, D., & Bisiani, R. (2010). Knowledge-Based Multi-Criteria Optimization to Support Indoor Positioning. RCRA@CPAIOR, 616. [pdf] [bib]
  2. Hermenegildo, M. V., & Schaub, T. (Eds.). (2010). Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010, July 16-19, 2010, Edinburgh, Scotland, UK (Vol. 7). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [bib]
  3. Hermenegildo, M. V., & Schaub, T. (2010). Titlepage, Table of Contents, Conference Organization. ICLP (Technical Communications), 7. [bib]
  4. Hermenegildo, M. V., & Schaub, T. (2010). Introduction to the Technical Communications of the 26th International Conference on Logic Programming. ICLP (Technical Communications), 7. [bib]
  5. Gebser, M., König, A., Schaub, T., Thiele, S., & Veber, P. (2010). The BioASP Library: ASP Solutions for Systems Biology. ICTAI (1), 383–389. [pdf] [bib]
  6. Gebser, M., Grote, T., & Schaub, T. (2010). Coala: A Compiler from Action Languages to ASP. JELIA, 6341, 360–364. [pdf] [bib]
  7. Gebser, M., Sabuncu, O., & Schaub, T. (2010). An Incremental Answer Set Programming Based System for Finite ModelComputation. JELIA, 6341, 169–181. [pdf] [bib]
  8. 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. KR. [pdf] [bib]
  9. Schaub, T. (2010). Answer Set Programming, the Solving Paradigm for Knowledge Representation and Reasoning. SUM, 6379, 2. [bib]
  10. Drescher, C., Gebser, M., Kaufmann, B., & Schaub, T. (2010). Heuristics in Conflict Resolution. CoRR, abs/1005.1716. [bib]
  11. Gebser, M., Schaub, T., Thiele, S., & Veber, P. (2010). Detecting Inconsistencies in Large Biological Networks with Answer Set Programming. CoRR, abs/1007.0134. [bib]
  12. Hermenegildo, M. V., & Schaub, T. (2010). Introduction to the 26th International Conference on Logic Programming Special Issue. CoRR, abs/1008.1710. [bib]
  13. Gebser, M., Lee, J., & Lierler, Y. (2010). On Elementary Loops of Logic Programs. CoRR, abs/1012.5847. [bib]
  14. Schaub, T., & Siegel, A. (2010). Testing, Diagnosing, Repairing, and Predicting from Regulatory Networks and Datasets. ERCIM News, 2010(82), 30. [pdf] [bib]
  15. Hermenegildo, M. V., & Schaub, T. (2010). Introduction to the 26th international conference on logic programming special issue. TPLP, 10(4-6), 361–364. [bib]
  16. Thiele, S., Klie, S., Jozefczuk, S., Selbig, J., & Blachon, S. (2010). Combinatorial Analysis of Transcription Regulation of Response to Oxidative Stresses in E. coli. ECCB, 23–23. [pdf] [bib]

2009

  1. Gebser, M., Kaufmann, B., & Schaub, T. (2009). Solution Enumeration for Projected Boolean Search Problems. CPAIOR, 5547, 71–86. [pdf] [bib]
  2. Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2009). Merging Logic Programs under Answer Set Semantics. ICLP, 5649, 160–174. [pdf] [bib]
  3. Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2009). On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers. ICLP, 5649, 250–264. [pdf] [bib]
  4. Gebser, M., Ostrowski, M., & Schaub, T. (2009). Constraint Answer Set Solving. ICLP, 5649, 235–249. [pdf] [bib]
  5. Schaub, T., & Thiele, S. (2009). Metabolic Network Expansion with Answer Set Programming. ICLP, 5649, 312–326. [pdf] [bib]
  6. Erdem, E., Lin, F., & Schaub, T. (Eds.). (2009). Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings (Vol. 5753). Springer. [bib]
  7. Denecker, M., Vennekens, J., Bond, S., Gebser, M., & Truszczynski, M. (2009). The Second Answer Set Programming Competition. LPNMR, 5753, 637–654. [pdf] [bib]
  8. Ellguth, E., Gebser, M., Gusowski, M., Kaufmann, B., Kaminski, R., Liske, S., Schaub, T., Schneidenbach, L., & Schnor, B. (2009). A Simple Distributed Conflict-Driven Answer Set Solver. LPNMR, 5753, 490–495. [pdf] [bib]
  9. Gebser, M., Kaminski, R., Ostrowski, M., Schaub, T., & Thiele, S. (2009). On the Input Language of ASP Grounder Gringo. LPNMR, 5753, 502–508. [pdf] [bib]
  10. Gebser, M., Kaufmann, B., & Schaub, T. (2009). The Conflict-Driven Answer Set Solver clasp: Progress Report. LPNMR, 5753, 509–514. [pdf] [bib]
  11. Ishebabi, H., Mahr, P., Bobda, C., Gebser, M., & Schaub, T. (2009). Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs. LPNMR, 5753, 598–603. [pdf] [bib]
  12. Schaub, T. (2009). Making Your Hands Dirty Inspires Your Brain! Or How to Switch ASP into Production Mode. LPNMR, 5753, 631–633. [pdf] [bib]
  13. Schneidenbach, L., Schnor, B., Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2009). Experiences Running a Parallel Answer Set Solver on Blue Gene. PVM/MPI, 5759, 64–72. [pdf] [bib]
  14. Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2009). A general approach to belief change in answer set programming. CoRR, abs/0912.5511. [bib]
  15. 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]
  16. Gebser, M., Gharib, M., Mercer, R. E., & Schaub, T. (2009). Monotonic Answer Set Programming. J. Log. Comput., 19(4), 539–564. [bib]
  17. Henin, T., & Schaub, T. (2009). A Transport Reaction Language: Preliminary Report. NRAC, 41–46. [pdf] [bib]
  18. Gebser, M., Hinrichs, H., Schaub, T., & Thiele, S. (2009). xpanda: A (Simple) Preprocessor for Adding Multi-Valued Propositions to ASP. WLP. [pdf] [bib]

2008

  1. Gebser, M., Pührer, J., Schaub, T., & Tompits, H. (2008). A Meta-Programming Technique for Debugging Answer-Set Programs. AAAI, 448–453. [pdf] [bib]
  2. Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. (2008). Advanced Preprocessing for Answer Set Solving. ECAI, 178, 15–19. [pdf] [bib]
  3. Schaub, T. (2008). Model-Based Knowledge Representation and Reasoning Via Answer Set Programming. FLOPS, 4989, 1–2. [bib]
  4. Gebser, M., Schaub, T., Tompits, H., & Woltran, S. (2008). Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. FoIKS, 4932, 24–41. [pdf] [bib]
  5. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., & Thiele, S. (2008). Engineering an Incremental ASP Solver. ICLP, 5366, 190–205. [pdf] [bib]
  6. Gebser, M., Schaub, T., Thiele, S., Usadel, B., & Veber, P. (2008). Detecting Inconsistencies in Large Biological Networks with Answer Set Programming. ICLP, 5366, 130–144. [pdf] [bib]
  7. Schaub, T. (2008). Here’s the Beef: Answer Set Programming ! ICLP, 5366, 93–98. [pdf] [bib]
  8. Dworschak, S., Grote, T., König, A., Schaub, T., & Veber, P. (2008). The System BioC for Reasoning about Biological Models in Action Language C. ICTAI (1), 11–18. [pdf] [bib]
  9. Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2008). Belief Revision of Logic Programs under Answer Set Semantics. KR, 411–421. [pdf] [bib]
  10. Drescher, C., Gebser, M., Grote, T., Kaufmann, B., König, A., Ostrowski, M., & Schaub, T. (2008). Conflict-Driven Disjunctive Answer Set Solving. KR, 422–432. [pdf] [bib]
  11. Dworschak, S., Grell, S., Nikiforova, V. J., Schaub, T., & Selbig, J. (2008). Modeling Biological Networks by Action Languages via Answer Set Programming. Constraints, 13(1-2), 21–65. [pdf] [bib]
  12. Drescher, C., Gebser, M., Kaufmann, B., & Schaub, T. (2008). Heuristics in Conflict Resolution. NMR@KR, 141–149. [pdf] [bib]
  13. Dworschak, S., Grote, T., König, A., Schaub, T., & Veber, P. (2008). Tools for Representing and Reasoning about Biological Models in Action Language C. NMR@KR, 94–102. [pdf] [bib]
  14. Gebser, M., Janhunen, T., Ostrowski, M., Schaub, T., & Thiele, S. (2008). A Versatile Intermediate Language for Answer Set Programming. NMR@KR, 150–159. [pdf] [bib]
  15. 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]

2007

  1. Delgrande, J. P., Liu, D. H., Schaub, T., & Thiele, S. (2007). COBA 2.0: A Consistency-Based Belief Change System. ECSQARU, 4724, 78–90. [pdf] [bib]
  2. Mileo, A., & Schaub, T. (2007). Qualitative Constraint Enforcement in Advanced Policy Specification. ECSQARU, 4724, 695–706. [pdf] [bib]
  3. Gebser, M. (2007). Advanced Techniques for Answer Set Programming. ICLP, 4670, 458–459. [bib]
  4. Gebser, M., & Schaub, T. (2007). Generic Tableaux for Answer Set Programming. ICLP, 4670, 119–133. [pdf] [bib]
  5. Delgrande, J. P., Lang, J., & Schaub, T. (2007). Belief Change Based on Global Minimisation. IJCAI, 2468–2473. [pdf] [bib]
  6. Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. (2007). Conflict-Driven Answer Set Solving. IJCAI, 386. [pdf] [bib]
  7. Brain, M., Gebser, M., Pührer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). Debugging ASP Programs by Means of ASP. LPNMR, 4483, 31–43. [pdf] [bib]
  8. Delgrande, J. P., Schaub, T., & Tompits, H. (2007). A Preference-Based Framework for Updating Logic Programs. LPNMR, 4483, 71–83. [pdf] [bib]
  9. Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. (2007). Conflict-Driven Answer Set Enumeration. LPNMR, 4483, 136–148. [pdf] [bib]
  10. Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. (2007). clasp: A Conflict-Driven Answer Set Solver. LPNMR, 4483, 260–265. [pdf] [bib]
  11. Gebser, M., Lee, J., & Lierler, Y. (2007). Head-Elementary-Set-Free Logic Programs. LPNMR, 4483, 149–161. [pdf] [bib]
  12. Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., & Truszczynski, M. (2007). The First Answer Set Programming System Competition. LPNMR, 4483, 3–17. [pdf] [bib]
  13. Gebser, M., Schaub, T., & Thiele, S. (2007). GrinGo : A New Grounder for Answer Set Programming. LPNMR, 4483, 266–271. [pdf] [bib]
  14. Gebser, M., Schaub, T., Tompits, H., & Woltran, S. (2007). Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. CENT, 265. [pdf] [bib]
  15. 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. INAP/WLP, 5437, 247–252. [bib]
  16. Delgrande, J. P., & Schaub, T. (2007). A consistency-based framework for merging knowledge bases. J. Applied Logic, 5(3), 459–477. [pdf] [bib]
  17. Delgrande, J. P., Schaub, T., & Tompits, H. (2007). A General Framework for Expressing Preferences in Causal Reasoning and Planning. J. Log. Comput., 17(5), 871–907. [pdf] [bib]
  18. Konczak, K. (2007). Preferences in answer set programming [PhD thesis]. University of Potsdam, Germany. [bib]
  19. Brain, M., Faber, W., Maratea, M., Polleres, A., Schaub, T., & Schindlauer, R. (2007). What should an ASP Solver output? A Multiple Position Paper. SEA, 26–37. [pdf] [bib]
  20. 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. SEA, 71–85. [pdf] [bib]
  21. Gebser, M., Gharib, M., & Schaub, T. (2007). Incremental Answer Sets and Their Computation. ASP, 161–174. [pdf] [bib]
  22. Gharib, M., Mercer, R., & Schaub, T. (2007). Incremental Answer Set Programming: A Preliminary Report. ASP, 149–160. [pdf] [bib]

2006

  1. Gebser, M., Lee, J., & Lierler, Y. (2006). Elementary Sets of Logic Programs. AAAI, 244–249. [pdf] [bib]
  2. Anger, C., Gebser, M., Janhunen, T., & Schaub, T. (2006). What’s a Head Without a Body? ECAI, 141, 769–770. [pdf] [bib]
  3. Gressmann, J., Janhunen, T., Mercer, R. E., Schaub, T., Thiele, S., & Tichy, R. (2006). On Probing and Multi-Threading in Platypus. ECAI, 141, 392–396. [pdf] [bib]
  4. Gebser, M., & Schaub, T. (2006). Tableau Calculi for Answer Set Programming. ICLP, 4079, 11–25. [pdf] [bib]
  5. Grell, S., Schaub, T., & Selbig, J. (2006). Modelling Biological Networks by Action Languages Via Answer Set Programming. ICLP, 4079, 285–299. [pdf] [bib]
  6. Konczak, K. (2006). Voting Theory in Answer Set Programming. WLP, 1843-06-02, 45–53. [pdf] [bib]
  7. Konczak, K. (2006). Weak Order Equivalence for Logic Programs with Preferences. WLP, 1843-06-02, 154–163. [pdf] [bib]
  8. Schaub, T. (2006). Tableaux Calculi for Answer Set Programming. WLP, 1843-06-02, 1–11. [bib]
  9. Faber, W., & Konczak, K. (2006). Strong order equivalence. Ann. Math. Artif. Intell., 47(1-2), 43–78. [bib]
  10. Konczak, K., Linke, T., & Schaub, T. (2006). Graphs and colorings for answer set programming. TPLP, 6(1-2), 61–106. [bib]
  11. Braban, G., Flöter, A., Möhlig, M., Pfeiffer, A. F. H., Schill, T., Schlösser, H. W., Schöfl, C., Selbig, J., & Spranger, J. (2006). A screening procedure for daily use to detect abnomal glucose metabolism in women with polycystic ovary. Diabetoligia 49, 2572–2579. [bib]
  12. Gebser, M., & Schaub, T. (2006). Characterizing ASP Inferences by Unit Propagation. LASH, 41–56. [pdf] [bib]
  13. Anger, C., Gebser, M., & Schaub, T. (2006). Approaching the Core of Unfounded Set. NMR, 58–66. [pdf] [bib]
  14. Delgrande, J., Liu, D., Schaub, T., & Thiele, S. (2006). COBA 2.0: A Consistency-Based Belief Change Syste. NMR, 267–273. [bib]
  15. Delgrande, J., Schaub, T., & Tompits, H. (2006). An Extended Query Language for Action Languages (and its Application to Aggregates and Preferences). NMR, IFI-06-04, 362–370. [pdf] [bib]
  16. Gressmann, J., Janhunen, T., Mercer, R., Schaub, T., Thiele, S., & Tichy, R. (2006). On Probing and Multi-Threading in Platypus. NMR, IFI-06-04, 30–38. [pdf] [bib]
  17. Delgrande, J., Schaub, T., & Tompits, H. (2006). A Preference-Based Framework for Updating Logic Programs: Preliminary Report. PREFS, 31–44. [bib]
  18. Mileo, A., & Schaub, T. (2006). Extending Ordered Disjunctions for Policy Enforcement: Preliminary report. PREFS, 45–59. [bib]

2005

  1. Anger, C., Gebser, M., Linke, T., Neumann, A., & Schaub, T. (2005). The nomore++ Approach to Answer Set Solving. Answer Set Programming, 142. [bib]
  2. Konczak, K., & Vogel, R. (2005). Abduction and Preferences in Linguistics. Answer Set Programming, 142. [bib]
  3. Bertossi, L. E., Hunter, A., & Schaub, T. (Eds.). (2005). Inconsistency Tolerance [result from a Dagstuhl seminar] (Vol. 3300). Springer. [bib]
  4. Brewka, G., Niemelä, I., Schaub, T., & Truszczynski, M. (Eds.). (2005). Nonmonotonic Reasoning, Answer Set Programming and Constraints, 24.-29. April 2005 (Vol. 05171). Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany. [bib]
  5. Bertossi, L. E., Hunter, A., & Schaub, T. (2005). Introduction to Inconsistency Tolerance. Inconsistency Tolerance, 3300, 1–14. [bib]
  6. Besnard, P., Schaub, T., Tompits, H., & Woltran, S. (2005). Representing Paraconsistent Reasoning via Quantified Propositional Logic. Inconsistency Tolerance, 3300, 84–118. [pdf] [bib]
  7. Brewka, G., Niemelä, I., Schaub, T., Truszczynski, M., & Vennekens, J. (2005). 05171 Abstracts Collection - Nonmonotonic Reasoning, Answer Set Programming and Constraints. Nonmonotonic Reasoning, Answer Set Programming and Constraints, 05171. [bib]
  8. Faber, W., & Konczak, K. (2005). Strong Equivalence for Logic Programs with Preferences. IJCAI, 430–435. [bib]
  9. Anger, C., Gebser, M., Linke, T., Neumann, A., & Schaub, T. (2005). The nomore++ Approach to Answer Set Solving. LPAR, 3835, 95–109. [pdf] [bib]
  10. Anger, C., Gebser, M., Linke, T., Neumann, A., & Schaub, T. (2005). The nomore++ System. LPNMR, 3662, 422–426. [pdf] [bib]
  11. Gebser, M., & Schaub, T. (2005). Loops: Relevant or Redundant? LPNMR, 3662, 53–65. [pdf] [bib]
  12. Grell, S., Konczak, K., & Schaub, T. (2005). nomore<: A System for Computing Preferred Answer Sets. LPNMR, 3662, 394–398. [bib]
  13. Gressmann, J., Janhunen, T., Mercer, R. E., Schaub, T., Thiele, S., & Tichy, R. (2005). Platypus: A Platform for Distributed Answer Set Solving. LPNMR, 3662, 227–239. [pdf] [bib]
  14. Konczak, K., & Vogel, R. (2005). Abduction and Preferences in Linguistics. LPNMR, 3662, 384–388. [bib]
  15. Konczak, K., Linke, T., & Schaub, T. (2005). Graphs and colorings for answer set programming. CoRR, abs/cs/0502082. [bib]
  16. Anger, C., Konczak, K., Linke, T., & Schaub, T. (2005). A Glimpse of Answer Set Programming. KI, 19(1), 12. [pdf] [bib]
  17. Delgrande, J. P., & Schaub, T. (2005). Expressing Default Logic Variants in Default Logic. J. Log. Comput., 15(5), 593–621. [pdf] [bib]
  18. Flöter, A. (2005). Analyzing biological expression data based on decision tree induction [PhD thesis]. University of Potsdam, Germany. [bib]
  19. Konczak, K., & Lang, J. (2005). Voting procedures with incomplete preferences. APH@IJCAI, 124–129. [bib]

2004

  1. Delgrande, J. P., Schaub, T., & Tompits, H. (2004). Domain-Specific Preferences for Causal Reasoning and Planning. ICAPS, 63–72. [bib]
  2. Linke, T., Tompits, H., & Woltran, S. (2004). On Acyclic and Head-Cycle Free Nested Logic Programs. ICLP, 3132, 225–239. [pdf] [bib]
  3. Bösel, A., Linke, T., & Schaub, T. (2004). Profiling Answer Set Programming: The Visualization Component of the noMoRe System. JELIA, 3229, 702–705. [pdf] [bib]
  4. Delgrande, J. P., & Schaub, T. (2004). Two Approaches to Merging Knowledge Bases. JELIA, 3229, 426–438. [pdf] [bib]
  5. Delgrande, J. P., Schaub, T., & Tompits, H. (2004). Domain-Specific Preferences for Causal Reasoning and Planning. KR, 673–682. [pdf] [bib]
  6. Linke, T., & Sarsakov, V. (2004). Suitable Graphs for Answer Set Programming. LPAR, 3452, 154–168. [bib]
  7. Borchert, P., Anger, C., Schaub, T., & Truszczynski, M. (2004). Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative. LPNMR, 2923, 3–7. [pdf] [bib]
  8. Konczak, K., Linke, T., & Schaub, T. (2004). Graphs and Colorings for Answer Set Programming: Abridged Report. LPNMR, 2923, 127–140. [pdf] [bib]
  9. Sarsakov, V., Schaub, T., Tompits, H., & Woltran, S. (2004). nlp: A Compiler for Nested Logic Programming. LPNMR, 2923, 361–364. [pdf] [bib]
  10. Delgrande, J. P., & Schaub, T. (Eds.). (2004). 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), Whistler, Canada, June 6-8, 2004, Proceedings. [bib]
  11. Delgrande, J. P., & Schaub, T. (2004). Consistency-based approaches to merging knowledge bases: preliminary report. NMR, 126–133. [pdf] [bib]
  12. Linke, T., Tompits, H., & Woltran, S. (2004). On acyclic and head-cycle free nested logic programs. NMR, 267–275. [pdf] [bib]
  13. Flöter, A., Nicolas, J., Schaub, T., & Selbig, J. (2004). Threshold extraction in metabolite concentration data. Bioinformatics, 20(10), 1491–1494. [pdf] [bib]
  14. Delgrande, J. P., & Schaub, T. (2004). Reasoning with Sets of Defaults in Default Logic. Computational Intelligence, 20(1), 56–88. [pdf] [bib]
  15. Delgrande, J. P., Schaub, T., Tompits, H., & Wang, K. (2004). A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Computational Intelligence, 20(2), 308–334. [pdf] [bib]
  16. Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2004). On Computing Belief Change Operations using Quantified Boolean Formulas. J. Log. Comput., 14(6), 801–826. [pdf] [bib]
  17. Flöter, A., Selbig, J., & Schaub, T. (2004). Finding Metabolic Pathways in Decision Forests. GfKl, 199–206. [pdf] [bib]

2003

  1. Delgrande, J. P., Gharib, M., Mercer, R. E., Risch, V., & Schaub, T. (2003). Lukaszewicz-style Answer Set Programming: A Preliminary Report. Answer Set Programming, 78. [pdf] [bib]
  2. Konczak, K., Schaub, T., & Linke, T. (2003). Graphs and coloring for answer set programming: Preliminary Report. Answer Set Programming, 78. [bib]
  3. Konczak, K., Schaub, T., & Linke, T. (2003). Graphs and colorings for answer set programming: Abridged Report. Answer Set Programming, 78. [pdf] [bib]
  4. Linke, T. (2003). Suitable Graphs for Answer Set Programming. Answer Set Programming, 78. [pdf] [bib]
  5. Linke, T. (2003). Using Nested Logic Programs for Answer Set Programming. Answer Set Programming, 78. [pdf] [bib]
  6. Besnard, P., Schaub, T., Tompits, H., & Woltran, S. (2003). Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. ECSQARU, 2711, 528–539. [pdf] [bib]
  7. Delgrande, J. P., & Schaub, T. (2003). On the Relation between Reiter’s Default Logic and Its (Major). ECSQARU, 2711, 452–463. [pdf] [bib]
  8. Flöter, A., Nicolas, J., Schaub, T., & Selbig, J. (2003). Threshold extraction in metabolite concentration data. German Conference on Bioinformatics, 33–39. [bib]
  9. Besnard, P., Mercer, R. E., & Schaub, T. (2003). Optimality Theory through Default Logic. KI, 2821, 93–104. [bib]
  10. Delgrande, J. P., & Schaub, T. (2003). A consistency-based approach for belief change. Artif. Intell., 151(1-2), 1–41. [pdf] [bib]
  11. Schaub, T., & Wang, K. (2003). A semantic framework for preference handling in answer set programming. CoRR, cs.AI/0301023. [pdf] [bib]
  12. Konczak, K., Schaub, T., & Linke, T. (2003). Graphs and Colorings for Answer Set Programming with Preferences. Fundam. Inform., 57(2-4), 393–421. [pdf] [bib]
  13. Besnard, P., Fanselow, G., & Schaub, T. (2003). Optimality Theory as a Family of Cumulative Logics. Journal of Logic, Language and Information, 12(2), 153–182. [pdf] [bib]
  14. Delgrande, J. P., Schaub, T., & Tompits, H. (2003). A Framework for Compiling Preferences in Logic Programs. TPLP, 3(2), 129–187. [pdf] [bib]
  15. Schaub, T., & Wang, K. (2003). A semantic framework for preference handling in answer set programming. TPLP, 3(4-5), 569–607. [pdf] [bib]
  16. Schaub, T. (2003). Antwortmengenprogrammierung. LOG IN, 122/123, 104–106. [pdf] [bib]

2002

  1. Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., & Woltran, S. (2002). A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. ICLP, 2401, 405–420. [pdf] [bib]
  2. Anger, C., Konczak, K., & Linke, T. (2002). NoMoRe : Non-monotonic Reasoning with Logic Programs. JELIA, 2424, 521–524. [pdf] [bib]
  3. Besnard, P., Schaub, T., Tompits, H., & Woltran, S. (2002). Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. JELIA, 2424, 320–331. [pdf] [bib]
  4. Delgrande, J. P., Hunter, A., & Schaub, T. (2002). COBA: A Consistency-Based Belief Revision System. JELIA, 2424, 509–512. [bib]
  5. Linke, T., Anger, C., & Konczak, K. (2002). More on noMoRe. JELIA, 2424, 468–480. [pdf] [bib]
  6. Besnard, P., Mercer, R. E., & Schaub, T. (2002). Optimality theory through default logic. NMR, 77–83. [pdf] [bib]
  7. Linke, T., Anger, C., & Konczak, K. (2002). More on noMoRe. NMR, 210–218. [pdf] [bib]
  8. Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., & Woltran, S. (2002). A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report. NMR, 57–66. [bib]
  9. Schaub, T., & Wang, K. (2002). Preferred well-founded semantics for logic programming by alternating fixpoints: preliminary report. NMR, 238–246. [pdf] [bib]
  10. Besnard, P., Schaub, T., Tompits, H., & Woltran, S. (2002). Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. Paraconsistent Computational Logic, 95, 1–15. [bib]
  11. Blake, M. B., Haigh, K. Z., Hexmoor, H., Falcone, R., Soh, L.-K., Baral, C., McIlraith, S. A., Gmytrasiewicz, P. J., Parsons, S., Malaka, R., Krüger, A., Bouquet, P., Smart, B., Kurumantani, K., Pease, A., Brenner, M., desJardins, M., Junker, U., Delgrande, J. P., … Ligozat, G. (2002). AAAI 2002 Workshops. AI Magazine, 23(4), 113–121. [bib]
  12. Delgrande, J. P., Schaub, T., & Tompits, H. (2002). A Framework for Compiling Preferences in Logic Programs. CoRR, cs.AI/0203005. [pdf] [bib]
  13. Schaub, T., & Wang, K. (2002). Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report. CoRR, cs.AI/0207060. [bib]
  14. Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., & Woltran, S. (2002). A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. CoRR, cs.AI/0207071. [bib]
  15. Delgrande, J. P., & Schaub, T. (2002). Reasoning Credulously and skeptically within a single extension. Journal of Applied Non-Classical Logics, 12(2), 259–285. [pdf] [bib]
  16. Delgrande, J., Schaub, T., Tompits, H., & Wang, K. (2002). Towards a Classification of Preference Handling Approaches in Nonmonotonic Reasoning. In U. Junker (Ed.), Preferences in Artificial Intelligence and Constraint Programming: Symbolic Approaches (pp. 16–24). AAAI Press. [pdf] [bib]

2001

  1. Schaub, T., & Wang, K. (2001). A Comparative Study of Logic Programs with Preference: Preliminary Report. Answer Set Programming. [bib]
  2. Anger, C., Konczak, K., & Linke, T. (2001). NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics. IJCAR, 2083, 325–330. [bib]
  3. Wang, K. (2001). A Top-Down Procedure for Disjunctive Well-Founded Semantics. IJCAR, 2083, 305–317. [pdf] [bib]
  4. Benferhat, S., & Besnard, P. (Eds.). (2001). Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 6th European Conference, ECSQARU 2001, Toulouse, France, September 19-21, 2001, Proceedings (Vol. 2143). Springer. [bib]
  5. Delgrande, J. P., & Schaub, T. (2001). How to Reason Credulously and Skeptically within a Single Extension. ECSQARU, 2143, 592–603. [pdf] [bib]
  6. Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2001). On Computing Solutions to Belief Change Scenarios. ECSQARU, 2143, 510–521. [bib]
  7. Schaub, T. (2001). What’s Your Preference? And How to Express and Implement It in Logic Programming! ECSQARU, 2143, 17. [bib]
  8. Linke, T. (2001). Graph Theoretical Characterization and Computation of Answer Sets. IJCAI, 641–648. [pdf] [bib]
  9. Schaub, T., & Wang, K. (2001). A Comparative Study of Logic Programs with Preference. IJCAI, 597–602. [pdf] [bib]
  10. Anger, C., Konczak, K., & Linke, T. (2001). NoMoRe : A System for Non-Monotonic Reasoning under Answer Set Semantics. LPNMR, 2173, 406–410. [bib]
  11. Delgrande, J. P., Schaub, T., & Tompits, H. (2001). plp: A Generic Compiler for Ordered Logic Programs. LPNMR, 2173, 411–415. [pdf] [bib]
  12. Wang, K. (2001). A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs. LPNMR, 2173, 133–146. [pdf] [bib]
  13. Besnard, P., & Hunter, A. (2001). A logic-based theory of deductive arguments. Artif. Intell., 128(1-2), 203–235. [bib]
  14. Kose, F., Weckwerth, W., Linke, T., & Fiehn, O. (2001). Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinformatics, 17(12), 1198–1208. [bib]
  15. Wang, K., & Zhou, L. (2001). Closed World Assumption for Disjunctive Reasoning. J. Comput. Sci. Technol., 16(4), 381–387. [bib]
  16. Wang, K., & Zhou, L. (2001). An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases. J. Intell. Inf. Syst., 16(3), 229–253. [pdf] [bib]
  17. Roessner, U., Luedemann, A., Brust, D., Fiehn, O., Linke, T., Willmitzer, L., & Fernie, A. R. (2001). Metabolic profiling allows comprehensive phenotyping of genetically or environmentally modified plant systems. Plant Cell, 13, 11–29. [bib]

2000

  1. Linke, T. (2000). New foundations for automation of default reasoning (Vol. 237). Infix. [bib]
  2. Besnard, P., & Hunter, A. (2000). Towards a Logic-Based Theory of Argumentation. AAAI/IAAI, 411–416. [bib]
  3. Delgrande, J. P., & Schaub, T. (2000). A Consistency-Based Model for Belief Change: Preliminary Report. AAAI/IAAI, 392–398. [bib]
  4. Brüning, S., & Schaub, T. (2000). A Connection Calculus for Handling Incomplete Information. Intellectics and Computational Logic, 19, 47–66. [bib]
  5. Wang, K., Zhou, L., & Lin, F. (2000). Alternating Fixpoint Theory for Logic Programs with Priority. Computational Logic, 1861, 164–178. [bib]
  6. Delgrande, J. P., Schaub, T., & Tompits, H. (2000). Logic Programs with Compiled Preferences. ECAI, 464–468. [pdf] [bib]
  7. Delgrande, J. P., Schaub, T., & Tompits, H. (2000). A Compilation of Brewka and Eiter’s Approach to Prioritization. JELIA, 1919, 376–390. [pdf] [bib]
  8. Besnard, P., & Schaub, T. (2000). Significant Inferences : Preliminary Report. KR, 401–410. [pdf] [bib]
  9. Delgrande, J. P., & Schaub, T. (2000). Expressing preferences in default logic. Artif. Intell., 123(1-2), 41–87. [pdf] [bib]
  10. Linke, T., & Schaub, T. (2000). Alternative foundations for Reiter’s default logic. Artif. Intell., 124(1), 31–86. [pdf] [bib]
  11. Delgrande, J. P., Schaub, T., & Tompits, H. (2000). A Compiler for Ordered Logic Programs. CoRR, cs.AI/0003024. [bib]
  12. Delgrande, J. P., Schaub, T., & Tompits, H. (2000). Logic Programs with Compiled Preferences. CoRR, cs.AI/0003028. [bib]
  13. Delgrande, J. P., & Schaub, T. (2000). A Consistency-Based Model for Belief Change: Preliminary Report. CoRR, cs.AI/0003052. [bib]
  14. Wang, K. (2000). Argumentation-based abduction in disjunctive logic programming. J. Log. Program., 45(1-3), 105–141. [bib]
  15. Besnard, P., & Schaub, T. (2000). What is a (non-constructive) non-monotone logical system? Theor. Comput. Sci., 238(1-2), 489–494. [bib]
  16. Wang, K., Zhou, L., & Lin, F. (2000). Alternating fixpoint theory for logic programs with priority. Proceedings of the First International Conference on Computational Logic, 1861, 164–178. [bib]
  17. Wang, P., & Besnard, P. (2000). Paraconsistent reasoning as an analytical tool. Formal and Applied Practical Reasoning. [bib]
  18. Besnard, P., & Lang, J. (2000). Graded paraconsistency. Frontiers in Paraconsistent Logic, 75–94. [bib]
  19. Altmann, T., Essigmann, B., Flöter, A., Kloska, S., & Zettier, P. (2000). Ein Verteiltes Informationssystem zur Verwaltung und Analyse von grossen mRNA-Expressionsdatenmengen. Informationsystems in Biotechnology, 13–16. [bib]
  20. Delgrande, J., & Schaub, T. (2000). The Role of Default Logic in Knowledge Representation. In J. Minker (Ed.), Logic-Based Artificial Intelligence (pp. 107–126). [pdf] [bib]

1999

  1. Benhammadi, F., Nicolas, P., & Schaub, T. (1999). Query-Answering in Prioritized Default Logic. ESCQARU, 1638, 32–42. [bib]
  2. Brüning, S., & Schaub, T. (1999). Avoiding Non-ground Variables. ESCQARU, 1638, 92–103. [bib]
  3. Linke, T., & Schaub, T. (1999). On Bottom-Up Pre-processing Techniques for Automated Default Reasoning. ESCQARU, 1638, 268–278. [bib]
  4. Linke, T., & Schaub, T. (1999). Default Reasoning via Blocking Sets. LPNMR, 1730, 247–261. [bib]
  5. Schaub, T. (1999). The Automation of Reasoning with Incomplete Information: From semantic foundations to efficient computation (Vol. 1409). Springer. [bib]

1998

  1. Schaub, T. (1998). The Automation of Reasoning with Incomplete Information, From Semantic Foundations to Efficient Computation (Vol. 1409). Springer. [bib]
  2. Benhammadi, F., Nicolas, P., & Schaub, T. (1998). Extension Calculus and Query Answering in Prioritized Default Logic. AIMSA, 1480, 76–87. [bib]
  3. Nicolas, P., & Schaub, T. (1998). The XRay system: An implementation platform for local query-answering in default logics. Applications of Uncertainty Formalisms, 1455, 354–378. [bib]
  4. Linke, T., & Schaub, T. (1998). An Approach to Query-Answering in Reiter’s Default Logic and the Underlying Existence of Extensions Problem. JELIA, 1489, 233–247. [bib]
  5. Delgrande, J. P., & Schaub, T. (1998). Reasoning with Sets of Preferences in Default Logic. PRICAI, 1531, 134–145. [bib]
  6. Schaub, T., & Brüning, S. (1998). Prolog Technology for Default Reasoning: Proof Theory and Compilation Techniques. Artif. Intell., 106(1), 1–75. [bib]
  7. Besnard, P., & Schaub, T. (1998). Signed Systems for Paraconsistent Reasoning. J. Autom. Reasoning, 20(1), 191–213. [bib]
  8. Schaub, T. (1998). The family of default logics. Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 2, 77–133. [bib]
  9. Bibel, W., Brüning, S., Otten, J., Rath, T., & Schaub, T. (1998). Compressions and extensions. In W. Bibel & P. H. Schmitt (Eds.), Automated Deduction — A Basis for Applications (Vol. 1, pp. 133–179). [bib]
  10. Nicolas, P., & Schaub, T. (1998). Un cadre général pour l’interrogation automatique en logiques des défauts. In Reconnaissance des formes et intelligence artificielle Clermont-Ferrand (pp. 381–390). Afcet Afia. [bib]
  11. Volkmann, G., Linke, T., Waschulzik, T., Ohmes, R., Schaub, T., & Wischnewsky, M. (1998). HExProSA – Ein hybrides Expertensystem zur Prozeßkontrolle und Störfallanalyse von Abwasserbehandlungsanlagen: Erfahrungen bei der Evaluierung eines Prototypen. Intelligente/Wissensbasierte Systeme in Der Umwelttechnik. [bib]
  12. Besnard, P., & Schaub, T. (1998). Characterization of non-monotone non-constructive systems. Proceedings of the Fifth Pacific Rim International Conference on Artificial Intelligence (PRICAI’98), 134–145. [bib]

1997

  1. Besnard, P., & Schaub, T. (1997). Circumscribing Inconsistency. IJCAI (1), 150–155. [bib]
  2. Delgrande, J. P., & Schaub, T. (1997). Compiling Reasoning with and about Preferences into Default Logic. IJCAI (1), 168–175. [bib]
  3. Schaub, T., & Nicolas, P. (1997). An Implementation Platform for Query-Answering in Default Logics: Theoretical Underpinnings. ISMIS, 1325, 197–206. [bib]
  4. Schaub, T., & Nicolas, P. (1997). An Implementation Platform for Query-Answering: X-RAY. LPNMR, 1265, 442–453. [bib]
  5. Delgrande, J. P., & Schaub, T. (1997). Compiling Specificity Into Approaches to Nonmonotonic Reasoning. Artif. Intell., 90(1-2), 301–348. [pdf] [bib]
  6. Linke, T., & Schaub, T. (1997). Towards a classification of Default Logics. Journal of Applied Non-Classical Logics, 7(4), 397–451. [bib]

1996

  1. Schaub, T., Brüning, S., & Nicolas, P. (1996). XRay: A Prolog Technology Theorem Prover for Default Reasoning: A System Description. CADE, 1104, 293–297. [bib]
  2. Schaub, T., & Brüning, S. (1996). Prolog Technology for Default Reasoning (An Abridged Report). ECAI, 105–109. [bib]
  3. Schaub, T., & Thielscher, M. (1996). Skeptical Query-Answering in Constrained Default Logic. FAPR, 1085, 567–581. [pdf] [bib]
  4. Brüning, S., & Schaub, T. (1996). A Model-Based Approach to Consistency-Checking. ISMIS, 1079, 315–324. [bib]
  5. Besnard, P., & Schaub, T. (1996). A Simple Signed System for Paraconsistent Reasoning. JELIA, 1126, 404–416. [bib]
  6. Linke, T., & Schaub, T. (1996). Putting Default Logics in Perspective. KI, 1137, 241–252. [bib]
  7. Lamarre, P., Siklóssy, L., & Schaub, T. (1996). Actes des Troisiémes Rencontres Nationales de Jeunes Chercheurs en Intelligence Artificielle. AFIA. [bib]

1995

  1. Linke, T., & Schaub, T. (1995). Lemma Handling in Default Logic Theorem Provers. ECSQARU, 946, 285–292. [pdf] [bib]
  2. Besnard, P., & Schaub, T. (1995). An Approach to Context-Based Default Reasoning. Fundam. Inform., 23(2/3/4), 175–223. [pdf] [bib]
  3. Schaub, T. (1995). A New Methodology for Query Answering in Default Logics via Structure-Oriented Theorem Proving. J. Autom. Reasoning, 15(1), 95–165. [pdf] [bib]
  4. Thielscher, M., & Schaub, T. (1995). Default Reasoning by Deductive Planning. J. Autom. Reasoning, 15(1), 1–40. [pdf] [bib]
  5. Furbach, U., Bürckert, H.-J., Hertzberg, J., Nebel, B., Brewka, G., Lakemeyer, G., Schaub, T., & Puppe, F. (1995). Ist die Wissensrepräsentation tot? KI, 9(5), 18–26. [bib]
  6. Brewka, G., & Schaub, T. (1995). Zur Verwendung nichtmonotoner Inferenztechniken bei der Konfiguration. In Methoden der Künstlichen Intelligenz für Grafikanwendungen (pp. 45–60). Addison Wesley. [pdf] [bib]

1994

  1. Brüning, S., & Schaub, T. (1994). Using Classical Theorem-Proving Techniques for Approximate Reasoning: Revised Report. IPMU, 945, 389–398. [pdf] [bib]
  2. Schaub, T. (1994). Computing Queries from Prioritized Default Theories. ISMIS, 869, 584–593. [bib]
  3. Delgrande, J. P., & Schaub, T. (1994). Incorporating Specificity into Circumscriptive Theories. KI, 861, 272–283. [bib]
  4. Delgrande, J. P., & Schaub, T. (1994). A General Approach to Specificity in Default Reasoning. KR, 146–157. [pdf] [bib]
  5. Delgrande, J. P., Schaub, T., & Jackson, W. K. (1994). Alternative Approaches to Default Logic. Artif. Intell., 70(1-2), 167–237. [pdf] [bib]
  6. Besnard, P., & Schaub, T. (1994). Possible Worlds Semantics for Default Logics. Fundam. Inform., 21(1/2), 39–66. [pdf] [bib]

1993

  1. Bibel, W., Hölldobler, S., & Schaub, T. (1993). Wissensrepräsentation und Inferenz - eine grundlegende Einführung. Vieweg. [bib]
  2. Beringer, A., & Schaub, T. (1993). Minimal Belief and Negation as Failure: A Feasible Approach. AAAI, 400–405. [pdf] [bib]
  3. Besnard, P., & Schaub, T. (1993). A Context-Based Framework for Default Logics. AAAI, 406–411. [pdf] [bib]
  4. Schaub, T. (1993). Variations of Constrained Default Logic. ECSQARU, 747, 310–317. [bib]

1992

  1. Schaub, T. (1992). Considerations on default logics [PhD thesis]. Darmstadt University of Technology, Germany. [pdf] [bib]
  2. Schaub, T. (1992). On Constrained Default Theories. ECAI, 304–308. [pdf] [bib]

1991

  1. Schaub, T. (1991). On Commitment and Cumulativity in Default Logics. ECSQARU, 548, 305–309. [bib]
  2. Schaub, T. (1991). Assertional Default Theories: A Semantical View. KR, 496–506. [bib]