@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{DelgrandeSchaubTompits2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A general framework for expressing preferences in causal reasoning and planning},
  issn      = {0955-792X},
  doi       = {10.1093/logcom/exm046},
  year      = {2007},
  abstract  = {We consider the problem of representing arbitrary preferences in causal reasoning and planning systems. In planning, a preference may be seen as a goal or constraint that is desirable, but not necessary, to satisfy. To begin, we define a very general query language for histories, or interleaved sequences of world states and actions. Based on this, we specify a second language in which preferences are defined. A single preference defines a binary relation on histories, indicating that one history is preferred to the other. From this, one can define global preference orderings on the set of histories, the maximal elements of which are the preferred histories. The approach is very general and flexible; thus it constitutes a base language in terms of which higher-level preferences may be defined. To this end, we investigate two fundamental types of preferences that we call choice and temporal preferences. We consider concrete strategies for these types of preferences and encode them in terms of our framework. We suggest how to express aggregates in the approach, allowing, e.g. the expression of a preference for histories with lowest total action costs. Last, our approach can be used to express other approaches and so serves as a common framework in which such approaches can be expressed and compared. We illustrate this by indicating how an approach due to Son and Pontelli can be encoded in our approach, as well as the language PDDL3.},
  language  = {en}
}
@article{BrainFaberMarateaetal.2007,
  author    = {Brain, Martin and Faber, Wolfgang and Maratea, Marco and Polleres, Axel and Schaub, Torsten H. and Schindlauer, Roman},
  title     = {What should an ASP solver output? : a multiple position paper},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeLiuSchaubetal.2007,
  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      = {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{GebserLeeLierler2007,
  author    = {Gebser, Martin and Lee, Joohyung and Lierler, Yuliya},
  title     = {Head-elementary-set-free logic programs},
  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 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     = {Clasp : a conflict-driven answer set solver},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{BrainGebserPuehreretal.2007,
  author    = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Debugging ASP programs by means of ASP},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GebserSchaubTompitsetal.2007,
  author    = {Gebser, Martin and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report},
  year      = {2007},
  language  = {en}
}