@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{KonczakVogel2005,
  author    = {Konczak, Kathrin and Vogel, Ralf},
  title     = {Abduction and preferences in linguistics : Extended abstract},
  issn      = {0302-9743},
  year      = {2005},
  language  = {en}
}
@article{KonczakLang2005,
  author    = {Konczak, Kathrin and Lang, Jerome},
  title     = {Voting procedures with incomplete preferences},
  year      = {2005},
  language  = {en}
}
@article{KonczakVogel2005,
  author    = {Konczak, Kathrin and Vogel, Ralf},
  title     = {Abduction and Preferences in Linguistics},
  year      = {2005},
  language  = {en}
}
@article{Camales2005,
  author    = {Camales, Renaud},
  title     = {Explicit formulation of the solution of Hamada-Leray-Wagschal's theorem},
  issn      = {0034-5318},
  year      = {2005},
  abstract  = {In this paper, an explicit formula of the solution of Hainada-Leray-Wagschal's theorem is given. For this, only structure's theorem of finite dimensional determination's function and linear algebra technics developped in [1] are used},
  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{SchneidenbachSchnor2005,
  author    = {Schneidenbach, Lars and Schnor, Bettina},
  title     = {Migration of MPI Applications to IPv6 Networks},
  isbn      = {0-88986-468-3},
  year      = {2005},
  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{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}
}