@article{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten H.},
  title     = {Tableau calculi for answer set programming},
  issn      = {0302-9743},
  doi       = {10.1007/11799573},
  year      = {2006},
  language  = {en}
}
@article{AngerGebserJanhunenetal.2006,
  author    = {Anger, Christian and Gebser, Martin and Janhunen, Tomi and Schaub, Torsten H.},
  title     = {What's a head without a body?},
  year      = {2006},
  language  = {en}
}
@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}
}
@article{DelgrandeLiuSchaubetal.2006,
  author    = {Delgrande, James Patrick and Liu, Daphne H. and Schaub, Torsten H. and Thiele, Sven},
  title     = {COBA 2.0 : a consistency-based belief change system},
  year      = {2006},
  language  = {en}
}
@article{DelgrandeSchaubTompits2006,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {An Extended Query language for action languages (and its application to aggregates and preferences)},
  year      = {2006},
  language  = {en}
}
@article{AngerGebserLinkeetal.2005,
  author    = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten H.},
  title     = {The nomore++ approach to answer set solving},
  year      = {2005},
  language  = {en}
}
@article{GressmannJanhunenMerceretal.2005,
  author    = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten H. and Thiele, Sven and Tichy, Richard},
  title     = {Platypus : a platform for distributed answer set solving},
  year      = {2005},
  language  = {en}
}
@article{AngerGebserLinkeetal.2005,
  author    = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten H.},
  title     = {The nomore++ approach to answer set solving},
  year      = {2005},
  language  = {en}
}
@article{GrellKonczakSchaub2005,
  author    = {Grell, Susanne and Konczak, Kathrin and Schaub, Torsten H.},
  title     = {nomore) : a system for computing preferred Answer Sets},
  issn      = {0302-9743},
  year      = {2005},
  language  = {en}
}
@article{AngerKonczakLinkeetal.2005,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {A Glimpse of Answer Set Programming},
  issn      = {0170-4516},
  year      = {2005},
  language  = {en}
}
@article{DelgrandeSchaub2005,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Expressing default logic variants in default logic},
  issn      = {0955-792X},
  year      = {2005},
  abstract  = {Reiter's default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Several variants of default logic have subsequently been proposed to give systems with properties differing from the original. In this paper, we examine the relationship between default logic and its major variants. We accomplish this by translating a default theory under a variant interpretation into a second default theory, under the original Reiter semantics, wherein the variant interpretation is respected. That is, in each case we show that, given an extension of a translated theory, one may extract an extension of the original variant default logic theory. We show how constrained, rational, justified, and cumulative default logic can be expressed in Reiter's default logic. As well, we show how Reiter's default logic can be expressed in rational default logic. From this, we suggest that any such variant can be similarly treated. Consequently, we provide a unification of default logics, showing how the original formulation of default logic may express its variants. Moreover, the translations clearly express the relationships between alternative approaches to default logic. The translations themselves are shown to generally have good properties. Thus, in at least a theoretical sense, we show that these variants are in a sense superfluous, in that for any of these variants of default logic, we can exactly mimic the behaviour of a variant in standard default logic. As well, the translations lend insight into means of classifying the expressive power of default logic variants; specifically we suggest that the property of semi-monotonicity represents a division with respect to expressibility, whereas regularity and cumulativity do not},
  language  = {en}
}