TY  - JOUR
A1  - Anger, Christian
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - A Glimpse of Answer Set Programming
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/~konczak/Papers/ankolisc05.pdf
SN  - 0170-4516
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  - Konczak, Kathrin
A1  - Vogel, Ralf
T1  - Abduction and Preferences in Linguistics
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05a.pdf
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Vogel, Ralf
T1  - Abduction and preferences in linguistics : Extended abstract
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05b.pdf
SN  - 0302-9743
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Graphs and cologings for answer set programming : adridged report
Y1  - 2004
SN  - 3-540- 20721-x
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Graphs and colorings for answer set programming
N2  - 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
Y1  - 2006
UR  - http://www.cs.kuleuven.ac.be/~dtai/projects/ALP//TPLP/
U6  - https://doi.org/10.1017/S1471068405002528
SN  - 1471-0684
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Graphs and colorings for answer set programming : abridged report
Y1  - 2003
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/kolisch03a.pdf
SN  - 1613-0073
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  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Anger, Christian
A1  - Konczak, Kathrin
T1  - More on nomore
Y1  - 2002
SN  - 3-540-44190-5
ER  -