TY  - JOUR
A1  - Gressmann, Jean
A1  - Janhunen, Tomi
A1  - Mercer, Robert E.
A1  - Schaub, Torsten H.
A1  - Thiele, Sven
A1  - Tichy, Richard
T1  - Platypus : a platform for distributed answer set solving
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/grjamescthti05a.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  - 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  - 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  - Camales, Renaud
T1  - Explicit formulation of the solution of Hamada-Leray-Wagschal's theorem
N2  - 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
Y1  - 2005
SN  - 0034-5318
ER  - 
TY  - JOUR
A1  - Anger, Christian
A1  - Gebser, Martin
A1  - Linke, Thomas
A1  - Neumann, Andre
A1  - Schaub, Torsten H.
T1  - The nomore++ approach to answer set solving
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/angelinesc05c.pdf
ER  - 
TY  - JOUR
A1  - Schneidenbach, Lars
A1  - Schnor, Bettina
T1  - Migration of MPI Applications to IPv6 Networks
Y1  - 2005
SN  - 0-88986-468-3
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  - Gebser, Martin
A1  - Schaub, Torsten H.
A1  - Thiele, Sven
T1  - GrinGo : a new grounder for answer set programming
Y1  - 2007
SN  - 978-3-540- 72199-4
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Lang, Jérôme
A1  - Schaub, Torsten H.
T1  - Belief change based on global minimisation
Y1  - 2007
ER  -