TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Lemma handling in default logic theorem provers
Y1  - 1995
SN  - 3540601120
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Putting default logics in perspective
Y1  - 1996
SN  - 3-540-61708-6
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Towards a classification of default logic
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Volkmann, Gerald
A1  - Linke, Thomas
A1  - Waschulzik, Thomas
A1  - Ohmes, Rick
A1  - Schaub, Torsten H.
A1  - Wischnewsky, M.
T1  - HExProSA - ein hybrides Expertensystem zur Prozeßkontrolle und Störfallanalyse von Abwasserbehandlungsanlagen : Erfahrungen bei der Evaluierung eines Prototypen
Y1  - 1998
UR  - http://home.zait.uni-bremen.de/~gerald/papers/pius-papers.html
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem.
Y1  - 1998
SN  - 3-540-65141-1
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Default reasoning via blocking sets
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - On bottom-up pre-processing techniques for automated default reasoning
Y1  - 1999
SN  - 3-540-66131-x
ER  - 
TY  - BOOK
A1  - Linke, Thomas
T1  - New foundations for automation of default reasoning
Y1  - 2000
SN  - 3-89838-237-0
VL  - 237
PB  - Akad. Verl.-Ges. Aka
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Alternative foundations for Reiter's default logic.
Y1  - 2000
SN  - 0004-3702
ER  - 
TY  - JOUR
A1  - Kose, F.
A1  - Weckwerth, Wolfram
A1  - Linke, Thomas
A1  - Fiehn, Oliver
T1  - Visualizing plant metabolomic correlation networks using clique-metabolite matrices
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Linke, Thomas
T1  - Graph theoretical characterization and computation of answer sets
Y1  - 2001
SN  - 1-558-60777-3
SN  - 1045-0823
ER  - 
TY  - JOUR
A1  - Anger, Christian
A1  - Konczak, Kathrin
A1  - Linke, Thomas
T1  - A system for non-monotonic reasoning under answer set semantics
Y1  - 2001
SN  - 3-540-42593-4
ER  - 
TY  - JOUR
A1  - Linke, Thomas
T1  - Graph theoretical characterization and computation of answer sets
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Roessner, Ute
A1  - Luedemann, A.
A1  - Brust, D.
A1  - Fiehn, Oliver
A1  - Linke, Thomas
A1  - Willmitzer, Lothar
A1  - Fernie, Alisdair R.
T1  - Metabolic profiling allows comprehensive phenotyping of genetically or environmentally modified plant systems
Y1  - 2001
SN  - 1040-4651
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Anger, Christian
A1  - Konczak, Kathrin
T1  - More on nomore
Y1  - 2002
ER  - 
TY  - JOUR
A1  - Anger, Christian
A1  - Konczak, Kathrin
A1  - Linke, Thomas
T1  - NoMoRe: Non-monotonic reasoning with logic programs
Y1  - 2002
SN  - 3-540-44190-5
ER  - 
TY  - JOUR
A1  - Anger, Christian
A1  - Konczak, Kathrin
A1  - Linke, Thomas
T1  - NoMoRe: A system for non-monotonic reasoning with logic programs under answer set semantics
Y1  - 2002
SN  - 3-540-42254-4
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Anger, Christian
A1  - Konczak, Kathrin
T1  - More on nomore
Y1  - 2002
SN  - 3-540-44190-5
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Schaub, Torsten H.
A1  - Linke, Thomas
T1  - Graphs and colorings for answer set programming with preferences
N2  - 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
Y1  - 2003
SN  - 0169-2968
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Schaub, Torsten H.
A1  - Linke, Thomas
T1  - Graphs and colorings for answer set programming with prefernces : preliminary report
Y1  - 2003
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/koschli03a.pdf
SN  - 1613-0073
ER  -