@article{LinkeTompitsWoltran2004,
  author    = {Linke, Thomas and Tompits, Hans and Woltran, Stefan},
  title     = {On Acyclic and head-cycle free nested logic programs},
  isbn      = {3-540-22671-01},
  year      = {2004},
  language  = {en}
}
@article{LinkeTompitsWoltran2004,
  author    = {Linke, Thomas and Tompits, Hans and Woltran, Stefan},
  title     = {On acyclic and head-cycle free nested logic programs},
  year      = {2004},
  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{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{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{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{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{Linke2003,
  author    = {Linke, Thomas},
  title     = {Suitable graphs for answer set programming},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{KonczakLinkeSchaub2003,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {Graphs and colorings for answer set programming : abridged report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten H. and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with prefernces : preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{Linke2003,
  author    = {Linke, Thomas},
  title     = {Using nested logic programs for answer set programming},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten H. and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with preferences},
  issn      = {0169-2968},
  year      = {2003},
  abstract  = {The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from non-preferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling strategies found in the literature. We start from a characterization of (three types of) preferred answer sets in terms of totally colored dependency graphs. In particular, we demonstrate that this approach allows us to capture all three approaches to preferences in a uniform setting by means of the concept of a height function. In turn, we exemplarily develop an operational characterization of preferred answer sets in terms of operators on partial colorings for one particular strategy. In analogy to the notion of a derivation in proof theory, our operational characterization is expressed as a (non-deterministically formed) sequence of colorings, gradually turning an uncolored graph into a totally colored one},
  language  = {en}
}
@article{AngerKonczakLinke2002,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas},
  title     = {NoMoRe: A system for non-monotonic reasoning with logic programs under answer set semantics},
  isbn      = {3-540-42254-4},
  year      = {2002},
  language  = {en}
}
@article{LinkeAngerKonczak2002,
  author    = {Linke, Thomas and Anger, Christian and Konczak, Kathrin},
  title     = {More on nomore},
  isbn      = {3-540-44190-5},
  year      = {2002},
  language  = {en}
}
@article{LinkeSchaub1997,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {Towards a classification of default logic},
  year      = {1997},
  language  = {en}
}
@article{LinkeSchaub1996,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {Putting default logics in perspective},
  isbn      = {3-540-61708-6},
  year      = {1996},
  language  = {en}
}
@article{LinkeSchaub1998,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem.},
  isbn      = {3-540-65141-1},
  year      = {1998},
  language  = {en}
}
@article{VolkmannLinkeWaschulziketal.1998,
  author    = {Volkmann, Gerald and Linke, Thomas and Waschulzik, Thomas and Ohmes, Rick and Schaub, Torsten H. and Wischnewsky, M.},
  title     = {HExProSA - ein hybrides Expertensystem zur Prozeßkontrolle und St{\"o}rfallanalyse von Abwasserbehandlungsanlagen : Erfahrungen bei der Evaluierung eines Prototypen},
  year      = {1998},
  language  = {de}
}
@article{LinkeSchaub1995,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {Lemma handling in default logic theorem provers},
  isbn      = {3540601120},
  year      = {1995},
  language  = {en}
}
@article{AngerKonczakLinke2002,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas},
  title     = {NoMoRe: Non-monotonic reasoning with logic programs},
  isbn      = {3-540-44190-5},
  year      = {2002},
  language  = {en}
}
@article{LinkeAngerKonczak2002,
  author    = {Linke, Thomas and Anger, Christian and Konczak, Kathrin},
  title     = {More on nomore},
  year      = {2002},
  language  = {en}
}
@article{RoessnerLuedemannBrustetal.2001,
  author    = {Roessner, Ute and Luedemann, A. and Brust, D. and Fiehn, Oliver and Linke, Thomas and Willmitzer, Lothar and Fernie, Alisdair R.},
  title     = {Metabolic profiling allows comprehensive phenotyping of genetically or environmentally modified plant systems},
  issn      = {1040-4651},
  year      = {2001},
  language  = {en}
}
@article{AngerKonczakLinke2001,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas},
  title     = {A system for non-monotonic reasoning under answer set semantics},
  isbn      = {3-540-42593-4},
  year      = {2001},
  language  = {en}
}
@article{Linke2001,
  author    = {Linke, Thomas},
  title     = {Graph theoretical characterization and computation of answer sets},
  isbn      = {1-558-60777-3},
  issn      = {1045-0823},
  year      = {2001},
  language  = {en}
}
@article{Linke2001,
  author    = {Linke, Thomas},
  title     = {Graph theoretical characterization and computation of answer sets},
  year      = {2001},
  language  = {en}
}
@article{KoseWeckwerthLinkeetal.2001,
  author    = {Kose, F. and Weckwerth, Wolfram and Linke, Thomas and Fiehn, Oliver},
  title     = {Visualizing plant metabolomic correlation networks using clique-metabolite matrices},
  year      = {2001},
  language  = {en}
}
@article{LinkeSchaub2000,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {Alternative foundations for Reiter's default logic.},
  issn      = {0004-3702},
  year      = {2000},
  language  = {en}
}
@book{Linke2000,
  author    = {Linke, Thomas},
  title     = {New foundations for automation of default reasoning},
  volume    = {237},
  publisher = {Akad. Verl.-Ges. Aka},
  address   = {Berlin},
  isbn      = {3-89838-237-0},
  pages     = {VII, 182 S.},
  year      = {2000},
  language  = {en}
}
@article{LinkeSchaub1999,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {On bottom-up pre-processing techniques for automated default reasoning},
  isbn      = {3-540-66131-x},
  year      = {1999},
  language  = {en}
}
@article{LinkeSchaub1999,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {Default reasoning via blocking sets},
  year      = {1999},
  language  = {en}
}