@article{BrainGebserPuehreretal.2007,
  author    = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description},
  year      = {2007},
  language  = {en}
}
@article{GebserSchaubTompitsetal.2007,
  author    = {Gebser, Martin and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report},
  year      = {2007},
  language  = {en}
}
@article{GebserSabuncuSchaub2011,
  author    = {Gebser, Martin and Sabuncu, Orkunt and Schaub, Torsten H.},
  title     = {An incremental answer set programming based system for finite model computation},
  series = {AI communications : AICOM ; the European journal on artificial intelligence},
  volume    = {24},
  journal   = {AI communications : AICOM ; the European journal on artificial intelligence},
  number    = {2},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {0921-7126},
  doi       = {10.3233/AIC-2011-0496},
  pages     = {195 -- 212},
  year      = {2011},
  abstract  = {We address the problem of Finite Model Computation (FMC) of first-order theories and show that FMC can efficiently and transparently be solved by taking advantage of a recent extension of Answer Set Programming (ASP), called incremental Answer Set Programming (iASP). The idea is to use the incremental parameter in iASP programs to account for the domain size of a model. The FMC problem is then successively addressed for increasing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We implemented a system based on the iASP solver iClingo and demonstrate its competitiveness by showing that it slightly outperforms the winner of the FNT division of CADE's 2009 Automated Theorem Proving (ATP) competition on the respective benchmark collection.},
  language  = {en}
}
@article{AngerGebserSchaub2006,
  author    = {Anger, Christian and Gebser, Martin and Schaub, Torsten H.},
  title     = {Approaching the core of unfounded sets},
  year      = {2006},
  language  = {en}
}
@misc{SchaepersNiemuellerLakemeyeretal.2018,
  author    = {Sch{\"a}pers, Bj{\"o}rn and Niemueller, Tim and Lakemeyer, Gerhard and Gebser, Martin and Schaub, Torsten H.},
  title     = {ASP-Based Time-Bounded Planning for Logistics Robots},
  series = {Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)},
  journal   = {Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018)},
  publisher = {ASSOC Association for the Advancement of Artificial Intelligence},
  address   = {Palo Alto},
  issn      = {2334-0835},
  pages     = {509 -- 517},
  year      = {2018},
  abstract  = {Manufacturing industries are undergoing a major paradigm shift towards more autonomy. Automated planning and scheduling then becomes a necessity. The Planning and Execution Competition for Logistics Robots in Simulation held at ICAPS is based on this scenario and provides an interesting testbed. However, the posed problem is challenging as also demonstrated by the somewhat weak results in 2017. The domain requires temporal reasoning and dealing with uncertainty. We propose a novel planning system based on Answer Set Programming and the Clingo solver to tackle these problems and incentivize robot cooperation. Our results show a significant performance improvement, both, in terms of lowering computational requirements and better game metrics.},
  language  = {en}
}
@article{GebserKaufmannNeumannetal.2007,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten H.},
  title     = {Clasp : a conflict-driven answer set solver},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GebserKaminskiSchaub2011,
  author    = {Gebser, Martin and Kaminski, Roland and Schaub, Torsten H.},
  title     = {Complex optimization in answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {11},
  journal   = {Theory and practice of logic programming},
  number    = {3},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068411000329},
  pages     = {821 -- 839},
  year      = {2011},
  abstract  = {Preference handling and optimization are indispensable means for addressing nontrivial applications in Answer Set Programming (ASP). However, their implementation becomes difficult whenever they bring about a significant increase in computational complexity. As a consequence, existing ASP systems do not offer complex optimization capacities, supporting, for instance, inclusion-based minimization or Pareto efficiency. Rather, such complex criteria are typically addressed by resorting to dedicated modeling techniques, like saturation. Unlike the ease of common ASP modeling, however, these techniques are rather involved and hardly usable by ASP laymen. We address this problem by developing a general implementation technique by means of meta-prpogramming, thus reusing existing ASP systems to capture various forms of qualitative preferences among answer sets. In this way, complex preferences and optimization capacities become readily available for ASP applications.},
  language  = {en}
}
@article{GebserKaufmannNeumannetal.2007,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten H.},
  title     = {Conflict-driven answer set enumeration},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GebserKaufmannNeumannetal.2007,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten H.},
  title     = {Conflict-driven answer set solving},
  isbn      = {978-1-57735-323-2},
  year      = {2007},
  language  = {en}
}
@article{GebserKaufmannSchaub2012,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Schaub, Torsten H.},
  title     = {Conflict-driven answer set solving: From theory to practice},
  series = {Artificial intelligence},
  volume    = {187},
  journal   = {Artificial intelligence},
  number    = {8},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2012.04.001},
  pages     = {52 -- 89},
  year      = {2012},
  abstract  = {We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply advanced solving techniques from the area of SAT. As a result, we present the first full-fledged algorithmic framework for native conflict-driven ASP solving. Our approach is implemented in the ASP solver clasp that has demonstrated its competitiveness and versatility by winning first places at various solver contests.},
  language  = {en}
}