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  - 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  - A system for non-monotonic reasoning under answer set semantics
Y1  - 2001
SN  - 3-540-42593-4
ER  - 
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  - Faber, Wolfgang
A1  - Konczak, Kathrin
T1  - Strong Equivalence for Logic Programs with Preferences
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/~konczak/Papers/fabkon05a.pdf
ER  - 
TY  - JOUR
A1  - Grell, Susanne
A1  - Konczak, Kathrin
A1  - Schaub, Torsten H.
T1  - nomore) : a system for computing preferred Answer Sets
Y1  - 2005
SN  - 0302-9743
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
T1  - Voting Theory in Answer Set Programming
Y1  - 2006
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
T1  - Weak order equivalence for Logic Programs with Prefernces
Y1  - 2006
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Lang, Jerome
T1  - Voting procedures with incomplete preferences
Y1  - 2005
UR  - http://koala.ilog.fr/wiki/pub/Preference05/WsProceedings/Pref05.pdf
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  -