@article{GebserKaminskiKaufmannetal.2018,
  author    = {Gebser, Martin and Kaminski, Roland and Kaufmann, Benjamin and L{\"u}hne, Patrick and Obermeier, Philipp and Ostrowski, Max and Romero Davila, Javier and Schaub, Torsten H. and Schellhorn, Sebastian and Wanko, Philipp},
  title     = {The Potsdam Answer Set Solving Collection 5.0},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0528-x},
  pages     = {181 -- 182},
  year      = {2018},
  abstract  = {The Potsdam answer set solving collection, or Potassco for short, bundles various tools implementing and/or applying answer set programming. The article at hand succeeds an earlier description of the Potassco project published in Gebser et al. (AI Commun 24(2):107-124, 2011). Hence, we concentrate in what follows on the major features of the most recent, fifth generation of the ASP system clingo and highlight some recent resulting application systems.},
  language  = {en}
}
@article{BanbaraInoueKaufmannetal.2018,
  author    = {Banbara, Mutsunori and Inoue, Katsumi and Kaufmann, Benjamin and Okimoto, Tenda and Schaub, Torsten H. and Soh, Takehide and Tamura, Naoyuki and Wanko, Philipp},
  title     = {teaspoon},
  series = {Annals of operation research},
  volume    = {275},
  journal   = {Annals of operation research},
  number    = {1},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {0254-5330},
  doi       = {10.1007/s10479-018-2757-7},
  pages     = {3 -- 37},
  year      = {2018},
  abstract  = {Answer Set Programming (ASP) is an approach to declarative problem solving, combining a rich yet simple modeling language with high performance solving capacities. We here develop an ASP-based approach to curriculum-based course timetabling (CB-CTT), one of the most widely studied course timetabling problems. The resulting teaspoon system reads a CB-CTT instance of a standard input format and converts it into a set of ASP facts. In turn, these facts are combined with a first-order encoding for CB-CTT solving, which can subsequently be solved by any off-the-shelf ASP systems. We establish the competitiveness of our approach by empirically contrasting it to the best known bounds obtained so far via dedicated implementations. Furthermore, we extend the teaspoon system to multi-objective course timetabling and consider minimal perturbation problems.},
  language  = {en}
}
@phdthesis{Kaufmann2015,
  author    = {Kaufmann, Benjamin},
  title     = {High performance answer set solving},
  pages     = {182},
  year      = {2015},
  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}
}
@article{GebserKaufmannSchaub2012,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Schaub, Torsten H.},
  title     = {Multi-threaded ASP solving with clasp},
  series = {Theory and practice of logic programming},
  volume    = {12},
  journal   = {Theory and practice of logic programming},
  number    = {8},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068412000166},
  pages     = {525 -- 545},
  year      = {2012},
  abstract  = {We present the new multi-threaded version of the state-of-the-art answer set solver clasp. We detail its component and communication architecture and illustrate how they support the principal functionalities of clasp. Also, we provide some insights into the data representation used for different constraint types handled by clasp. All this is accompanied by an extensive experimental analysis of the major features related to multi-threading in clasp.},
  language  = {en}
}
@article{GebserKaufmannKaminskietal.2011,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Kaminski, Roland and Ostrowski, Max and Schaub, Torsten H. and Schneider, Marius},
  title     = {Potassco the Potsdam answer set solving collection},
  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-0491},
  pages     = {107 -- 124},
  year      = {2011},
  abstract  = {This paper gives an overview of the open source project Potassco, the Potsdam Answer Set Solving Collection, bundling tools for Answer Set Programming developed at the University of Potsdam.},
  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{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}
}