@article{GrellSchaubSelbig2006,
  author    = {Grell, Susanne and Schaub, Torsten and Selbig, Joachim},
  title     = {Modelling biological networks by action languages via set programming},
  issn      = {0302-9743},
  doi       = {10.1007/11799573},
  year      = {2006},
  language  = {en}
}
@article{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten},
  title     = {Tableau calculi for answer set programming},
  issn      = {0302-9743},
  doi       = {10.1007/11799573},
  year      = {2006},
  language  = {en}
}
@article{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten},
  title     = {Characterizing (ASP) inferences by unit propagation},
  year      = {2006},
  language  = {en}
}
@phdthesis{Kaufmann2015,
  author    = {Kaufmann, Benjamin},
  title     = {High performance answer set solving},
  pages     = {182},
  year      = {2015},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {On Computing belief change operations using quantifield boolean formulas},
  issn      = {0955-792X},
  year      = {2004},
  abstract  = {In this paper, we show how an approach to belief revision and belief contraction can be axiomatized by means of quantified Boolean formulas. Specifically, we consider the approach of belief change scenarios, a general framework that has been introduced for expressing different forms of belief change. The essential idea is that for a belief change scenario (K, R, C), the set of formulas K, representing the knowledge base, is modified so that the sets of formulas R and C are respectively true in, and consistent with the result. By restricting the form of a belief change scenario, one obtains specific belief change operators including belief revision, contraction, update, and merging. For both the general approach and for specific operators, we give a quantified Boolean formula such that satisfying truth assignments to the free variables correspond to belief change extensions in the original approach. Hence, we reduce the problem of determining the results of a belief change operation to that of satisfiability. This approach has several benefits. First, it furnishes an axiomatic specification of belief change with respect to belief change scenarios. This then leads to further insight into the belief change framework. Second, this axiomatization allows us to identify strict complexity bounds for the considered reasoning tasks. Third, we have implemented these different forms of belief change by means of existing solvers for quantified Boolean formulas. As well, it appears that this approach may be straightforwardly applied to other specific approaches to belief change},
  language  = {en}
}
@article{FloeterNicolasSchaubetal.2004,
  author    = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten and Selbig, Joachim},
  title     = {Threshold extraction in metabolite concentration data},
  year      = {2004},
  abstract  = {Motivation: Continued development of analytical techniques based on gas chromatography and mass spectrometry now facilitates the generation of larger sets of metabolite concentration data. An important step towards the understanding of metabolite dynamics is the recognition of stable states where metabolite concentrations exhibit a simple behaviour. Such states can be characterized through the identification of significant thresholds in the concentrations. But general techniques for finding discretization thresholds in continuous data prove to be practically insufficient for detecting states due to the weak conditional dependences in concentration data. Results: We introduce a method of recognizing states in the framework of decision tree induction. It is based upon a global analysis of decision forests where stability and quality are evaluated. It leads to the detection of thresholds that are both comprehensible and robust. Applied to metabolite concentration data, this method has led to the discovery of hidden states in the corresponding variables. Some of these reflect known properties of the biological experiments, and others point to putative new states},
  language  = {en}
}
@article{DelgrandeGharibMerceretal.2003,
  author    = {Delgrande, James Patrick and Gharib, Mona and Mercer, Robert E. and Risch, V. and Schaub, Torsten},
  title     = {Lukaszewicz-style answer set programming : a preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {On the relation between Reiter{\"i}s default logic and its (major) variants},
  isbn      = {3-540- 409494-5},
  year      = {2003},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with prefernces : preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{BesnardMercerSchaub2003,
  author    = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten},
  title     = {Optimality theory throught default logic},
  isbn      = {3-540-20059-2},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaubTompits2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {A framework for compiling preferences in logic programs},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Reasoning credulously and skeptically within a single extension},
  year      = {2003},
  language  = {en}
}
@article{SchaubWang2003,
  author    = {Schaub, Torsten and Wang, Kewen},
  title     = {A semantic framework for prefernce handling in answer set programming},
  year      = {2003},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1999,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten},
  title     = {Query-answering in prioritized default logic},
  isbn      = {3-540-66131-X},
  year      = {1999},
  language  = {en}
}
@article{LinkeSchaub1999,
  author    = {Linke, Thomas and Schaub, Torsten},
  title     = {On bottom-up pre-processing techniques for automated default reasoning},
  isbn      = {3-540-66131-x},
  year      = {1999},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1999,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten},
  title     = {Query-answering in prioritized default logic},
  isbn      = {3-540-66131-X},
  year      = {1999},
  language  = {en}
}
@article{BrueningSchaub1999,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten},
  title     = {Avoiding non-ground variables},
  isbn      = {3-540-66131-x},
  year      = {1999},
  language  = {en}
}
@article{NicolasSchaub1998,
  author    = {Nicolas, Pascal and Schaub, Torsten},
  title     = {The XRay system : an implementation platform for local query-answering in default logics},
  isbn      = {3-540-65312-0},
  year      = {1998},
  language  = {en}
}
@article{BrueningSchaub1999,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten},
  title     = {A voiding non-ground variables},
  year      = {1999},
  language  = {en}
}
@book{Schaub1999,
  author    = {Schaub, Torsten},
  title     = {The automation of reasoning with incomplete information : from semantic foundations to efficient computation},
  series = {Lecture notes in computer science},
  volume    = {1409},
  journal   = {Lecture notes in computer science},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {3-540-64515-2},
  doi       = {10.1007/BFb0054963},
  pages     = {XI, 159 S.},
  year      = {1999},
  language  = {en}
}