@article{BesnardMercerSchaub2003,
  author    = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten H.},
  title     = {Optimality theory throught default logic},
  isbn      = {3-540-20059-2},
  year      = {2003},
  language  = {en}
}
@article{BesnardMercerSchaub2002,
  author    = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten H.},
  title     = {Optimality Theory via Default Logic},
  year      = {2002},
  language  = {en}
}
@article{DelgrandeGharibMerceretal.2003,
  author    = {Delgrande, James Patrick and Gharib, Mona and Mercer, Robert E. and Risch, V. and Schaub, Torsten H.},
  title     = {Lukaszewicz-style answer set programming : a preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{GebserGharibMerceretal.2009,
  author    = {Gebser, Martin and Gharib, Mona and Mercer, Robert E. and Schaub, Torsten H.},
  title     = {Monotonic answer set programming},
  issn      = {0955-792X},
  doi       = {10.1093/logcom/exn040},
  year      = {2009},
  abstract  = {Answer set programming (ASP) does not allow for incrementally constructing answer sets or locally validating constructions like proofs by only looking at a part of the given program. In this article, we elaborate upon an alternative approach to ASP that allows for incremental constructions. Our approach draws its basic intuitions from the area of default logics. We investigate the feasibility of the concept of semi-monotonicity known from default logics as a basis of incrementality. On the one hand, every logic program has at least one answer set in our alternative setting, which moreover can be constructed incrementally based on generating rules. On the other hand, the approach may produce answer sets lacking characteristic properties of standard answer sets, such as being a model of the given program. We show how integrity constraints can be used to re-establish such properties, even up to correspondence with standard answer sets. Furthermore, we develop an SLD-like proof procedure for our incremental approach to ASP, which allows for query-oriented computations. Also, we provide a characterization of our definition of answer sets via a modification of Clarks completion. Based on this notion of program completion, we present an algorithm for computing the answer sets of a logic program in our approach.},
  language  = {en}
}
@article{GharibSchaubMercer2007,
  author    = {Gharib, Mona and Schaub, Torsten H. and Mercer, Robert E.},
  title     = {Incremental answer set programming : a preliminary report},
  year      = {2007},
  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{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{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}
}