@article{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten H.},
  title     = {Characterizing (ASP) inferences by unit propagation},
  year      = {2006},
  language  = {en}
}
@article{DelgrandeSchaubTompits2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A preference-based framework for updating logic programs},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{MileoSchaub2007,
  author    = {Mileo, Alessandra and Schaub, Torsten H.},
  title     = {Qualitative constraint enforcement in advanced policy specification},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeLangSchaub2007,
  author    = {Delgrande, James Patrick and Lang, J{\´e}r{\^o}me and Schaub, Torsten H.},
  title     = {Belief change based on global minimisation},
  year      = {2007},
  language  = {en}
}
@article{KonczakLinkeSchaub2006,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {Graphs and colorings for answer set programming},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068405002528},
  year      = {2006},
  abstract  = {We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We start with different characterizations of answer sets in terms of totally colored dependency graphs that differ ill graph-theoretical aspects. We then develop a series of operational characterizations of answer sets in terms of operators on partial colorings. In analogy to the notion of a derivation in proof theory, our operational characterizations are expressed as (non-deterministically formed) sequences of colorings, turning an uncolored graph into a totally colored one. In this way, we obtain an operational framework in which different combinations of operators result in different formal properties. Among others, we identify the basic strategy employed by the noMoRe system and justify its algorithmic approach. Furthermore, we distinguish operations corresponding to Fitting's operator as well as to well-founded semantics},
  language  = {en}
}
@article{GebserSchaubThiele2007,
  author    = {Gebser, Martin and Schaub, Torsten H. and Thiele, Sven},
  title     = {GrinGo : a new grounder for answer set programming},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{KonczakLinkeSchaub2004,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {Graphs and cologings for answer set programming : adridged report},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@article{BoeselLinkeSchaub2004,
  author    = {Boesel, Andreas and Linke, Thomas and Schaub, Torsten H.},
  title     = {Profiling answer set programming : the visualization component of the noMoRe System},
  isbn      = {3-540-23242-7},
  year      = {2004},
  language  = {en}
}
@article{GressmannJanhunenMerceretal.2006,
  author    = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten H. and Thiele, Sven and Tichy, Richard},
  title     = {On probing and multi-threading in platypus},
  year      = {2006},
  language  = {en}
}
@article{MileoSchaub2006,
  author    = {Mileo, Alessandra and Schaub, Torsten H.},
  title     = {Extending ordered disjunctions for policy enforcement : preliminary report},
  year      = {2006},
  language  = {en}
}